A Comparison of BDD-Based Parity Game Solvers

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...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Sanchez, Lisette, Wesselink, Wieger, Willemse, Tim A C
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 10.09.2018
Subjects
Algorithms
Computer Science - Logic in Computer Science
Games
Iterative algorithms
Parity
Solvers
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.1809.03097