5 citations · 14 across the 6 of their papers we have counts for
8 papers
Leveraging the Power of Graph Algorithms: Efficient Algorithms for Computer-Aided Verification
Alexander Svozil
The goal of the thesis is to leverage fast graph algorithms and modern algorithmic techniques for problems in model checking and synthesis on graphs, MDPs, and game graphs. The res…
Symbolic Time and Space Tradeoffs for Probabilistic Verification
Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger +1
We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision pro…
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger +1
The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two clas…
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger +1
Solving parity games, which are equivalent to modal -calculus model checking, is a central algorithmic problem in formal methods. Besides the standard computation model with the…
Fully Dynamic k-Center Clustering in Doubling Metrics
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski +2
Clustering is one of the most fundamental problems in unsupervised learning with a large number of applications. However, classical clustering algorithms assume that the data is st…
Algorithms and Conditional Lower Bounds for Planning Problems
Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger +1
We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction wi…
Faster Algorithms for Mean-Payoff Parity Games
Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil
Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players.…
Induction and physical theory formation as well as universal computation by machine learning
Alexander Svozil, Karl Svozil
Machine learning presents a general, systematic framework for the generation of formal theoretical models for physical description and prediction. Tentatively standard linear model…