Oink: An Implementation and Evaluation of Modern Parity Game Solvers



Published in: TACAS (1) pp 291–308

DOI: 10.1007/978-3-319-89960-2_16



Parity games have important practical applications in formal verification and synthesis, especially to solve the model-checking problem of the modal mu-calculus. They are also interesting from the theory perspective, as they are widely believed to admit a polynomial solution, but so far no such algorithm is known. In recent years, a number of new algorithms and improvements to existing algorithms have been proposed. We implement a new and easy to extend tool Oink, which is a high-performance implementation of modern parity game algorithms. We further present a comprehensive empirical evaluation of modern parity game algorithms and solvers, both on real world benchmarks and randomly generated games. Our experiments show that our new tool Oink outperforms the current state-of-the-art.

BibTeX entry:

 author = {Tom van Dijk},
 booktitle = {TACAS (1)},
 doi = {10.1007/978-3-319-89960-2_16},
 pages = {291--308},
 publisher = {Springer},
 series = {LNCS},
 talk = {2018oink_talk.pdf},
 title = {Oink: An Implementation and Evaluation of Modern Parity Game Solvers},
 url = {https://arxiv.org/abs/1801.03859},
 volume = {10805},
 year = {2018}