Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Weak Muller Acceptance Conditions for Tree Automata
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Complexity of Some Infinite Games Played on Finite Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
How much memory is needed to win infinite games?
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Stochastic Müller games are PSPACE-complete
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
On reachability games of ordinal length
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Decision problems for Nash equilibria in stochastic games
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On Müller context-free grammars
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Extracting winning strategies in update games
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
On Müller context-free grammars
Theoretical Computer Science
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
The complexity of stochastic Müller games
Information and Computation
Concurrent games with ordered objectives
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Strategy machines and their complexity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Strategy composition in compositional games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We consider the complexity of infinite games played on finite graphs. We establish a framework in which the expressiveness and succinctness of different types of winning conditions can be compared. We show that the problem of deciding the winner in Muller games is PSPACE-complete. This is then used to establish PSPACE-completeness for Emerson-Lei games and for games described by Zielonka DAGs. Adaptations of the proof show PSPACE-completeness for the emptiness problem for Muller automata as well as the model-checking problem for such automata on regular trees. We also show co-NP-completeness for two classes of union-closed games: games specified by a basis and superset Muller games.