Small Progress Measures for Solving Parity Games
Top Cited Papers
- 24 March 2000
- book chapter
- Published by Springer Nature
- p. 290-301
- https://doi.org/10.1007/3-540-46541-3_24
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Deciding the winner in parity games is in UP ∩ co-UPInformation Processing Letters, 1998
- Fully local and efficient evaluation of alternating fixed pointsPublished by Springer Nature ,1998
- An improved algorithm for the evaluation of fixpoint expressionsTheoretical Computer Science, 1997
- Fast and simple nested fixpointsInformation Processing Letters, 1996
- Pushdown processes: Games and model checkingPublished by Springer Nature ,1996
- Progress measures, immediate determinacy, and a subset construction for tree automataAnnals of Pure and Applied Logic, 1994
- Infinite games played on finite graphsAnnals of Pure and Applied Logic, 1993
- On model-checking for fragments of μ-calculusPublished by Springer Nature ,1993
- An automata theoretic decision procedure for the propositional mu-calculusInformation and Computation, 1989
- The complexity of tree automata and logics of programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988