Algorithms for Parity Games

Abstract

The central point of this thesis is the implementation of the Scala Parity Game Solver a collection of tools for solving parity games and experimental comparison of parity games solving algorithms. The thesis also provides basic introduction to the problematics of solving parity games. Next, the design of the suite is analyzed in detail. After that, the suite is benchmarked and implemented solvers are compared. The resulting SPGSolver application is implemented in Scala. It allows to compare algorithms by their running time, as well as by the number of the operations performed. A description and an example implementation of three parity games solving algorithms is provided: a recursive algorithm (by Zielonka,W.), a small dominion finding algorithm (by Jurdzinski, M., Paterson, M., Zwick, U.) and an optimal strategy improvement algorithm (by Schewe, S.).