Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Practical Model-Checking Using Games
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A Multi-Core Solver for Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A Solver for Modal Fixpoint Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Fo(fd): Extending classical logic with rule-based fixpoint definitions
Theory and Practice of Logic Programming
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Bisimulation minimisations for boolean equation systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Stuttering mostly speeds up solving parity games
NFM'11 Proceedings of the Third international conference on NASA Formal methods
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A decision procedure for CTL* based on tableaux and automata
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Concurrent small progress measures
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Fatal attractors in parity games
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
GOAL for games, omega-automata, and logics
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model checking) for temporal logics. In this paper we investigate practical aspects of solving parity games. The main contribution is a suggestion on how to solve parity games efficiently in practice: we present a generic solver that intertwines optimisations with any of the existing parity game algorithms which is only called on parts of a game that cannot be solved faster by simpler methods. This approach is evaluated empirically on a series of benchmarking games from the aforementioned application domains, showing that using this approach vastly speeds up the solving process. As a side-effect we obtain the surprising observation that Zielonka's recursive algorithm is the best parity game solver in practice.