55 citations · 145 across the 14 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.GT2019★ 4 cited
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…
cs.GT2019★ 5 cited
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…