Solving Parity Games on the GPU
We present our GPU-based implementations of three well-known algorithms for solving parity games. Our implementations are in general faster by a factor of at least two than the corresponding implementations found in the widely known PGSolver collection of solvers. For benchmarking we use several of PGSolver’s benchmarks as well as arenas obtained by means of the reduction of the language inclusion problem of nondeterministic Büchi automata to parity games with only three colors . The benchmark suite of http://languageinclusion.org/CONCUR2011 was used in the latter case.
Unable to display preview. Download preview PDF.
- 4.Friedmann, O., Lange, M.: The PGSolver collection of parity game solvers. University of Munich (2009), http://www2.tcs.ifi.lmu.de/pgsolver/
- 6.Luttenberger, M.: Strategy iteration using non-deterministic strategies for solving parity games. Tech. rep., Technische Universität München, Institut für Informatik (April 2008)Google Scholar