55 citations · 145 across the 14 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter
Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger +1
A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist o…
cs.DS2017
Improved Set-based Symbolic Algorithms for Parity Games
Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger +1
Graph games with ω-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the syn…