5 citations · 14 across the 6 of their papers we have counts for
3 papers · 1 filter
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…
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.…