2018/09/10 by Lisette Sanchez, Wieger Wesselink, Tim A. C. Willemse
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.277.8
published as EPTCS 277, 2018, pp. 103-117 · In Proceedings GandALF 2018, arXiv:1809.02416
arxiv created 2018/09/10 · arxiv updated 2018/09/11
Parity games are two player games with omega-winning conditions, played on finite graphs. Such games play an important role in verification, satisfiability and synthesis. It is therefore important to identify algorithms that can efficiently deal with large games that arise from such applications. In this paper, we describe our experiments with BDD-based implementations of four parity game solving algorithms, viz. Zielonka's recursive algorithm, the more recent Priority Promotion algorithm, the Fixpoint-Iteration algorithm and the automata based APT algorithm. We compare their performance on several types of random games and on a number of cases taken from the Keiren benchmark set.