@inproceedings{abe9dce469dc499096a1bf4d3295a57c,
title = "A comparison of BDD-based parity game solvers",
abstract = "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.",
author = "Lisette Sanchez and Wieger Wesselink and Willemse, \{Tim A.C.\}",
year = "2018",
month = sep,
day = "7",
doi = "10.4204/EPTCS.277.8",
language = "English",
series = "Electronic Proceedings in Theoretical Computer Science ",
publisher = "Open Publishing Association",
pages = "103--117",
booktitle = "Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification",
address = "Australia",
note = "9th International Symposium on Games, Automata, Logics, and Formal Verification, G and ALF 2018 ; Conference date: 26-09-2018 Through 28-09-2018",
}