Be the first to like this
Parity games are a formalism that is used in software verification. The question whether a computer system satisfies a given property can be described as a parity game.
The complexity of solving parity games (the problem is in NP and co-NP), makes that het problem is not only interesting from a software verification point of view, but also from a complexity theoretic perspective. As a consequence, in recent years a large number of algorithms and heuristics for solving parity games have been developed. However, in this papers often only the theoretical complexity of the algorithm is considered, or, if experiments are performed they are based on a small set of parity games.
In this talk, I introduce a large set of parity games that should lead to better and more complete comparisons of algorithms that have been introduced in the literature.
This talk was presented at FSEN 2015. See my blog at http://www.jeroenkeiren.nl/blog/paper-benchmarking-parity-games/ for a more detailed description, and a download of the corresponding paper.