A Comparison of BDD-Based Parity Game Solvers

  title={A Comparison of BDD-Based Parity Game Solvers},
  author={Lisette Sanchez and Wieger Wesselink and Tim A. C. Willemse},
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… 

Figures and Tables from this paper

On-The-Fly Solving for Symbolic Parity Games
This work formalises how to use on-the-fly solving techniques during the exploration process for symbolic parity games and studies their effectiveness in practice, showing that speed-ups of several orders of magnitude are feasible and overhead (if unavoidable) is typically low.
Symbolic Parity Game Solvers that Yield Winning Strategies
Two symbolic algorithms that yield winning strategies, based on two recently proposed fixpoint algorithms, are proposed, which are competitive with or faster than an earlier symbolic implementation of Zielonka's recursive algorithm, while also providing the winning strategies.
Simple Fixpoint Iteration To Solve Parity Games
This work introduces an algorithm that relies on the notion of a distraction and shows that this algorithm is in fact identical to two earlier published fixpoint algorithms for parity games and thus that these earlier algorithms are the same.
Cheap CTL Compassion in NuSMV
The syntax in the well-known symbolic model checker NuSMV is implemented, consequently also implementing \(\mathsf {CTL}\) model checking with “compassion” objectives, and the resulting specifications correspond to parity games with two priorities.
Priority Promotion with Parysian Flair
An algorithm is developed that combines the advantages of priority promotion - the leading approach to solving large parity games in practice - with the quasi-polynomial time guarantees offered by Parys' algorithm, and shows that an interface that respects both is not only effective, but also efficient.
Energy mu-Calculus: Symbolic Fixed-Point Algorithms for omega-Regular Energy Games
The syntax and semantics of energy $\mu$-calculus are defined over symbolic representations of the game graphs, and it is shown how to use it to solve the decision and the minimum credit problems for $\omega$-regular energy games, for both bounded and unbounded energy level accumulations.


Solving Parity Games Using an Automata-Based Algorithm
Parity games are abstract infinite-round games that take an important role in formal verification and are implemented in a platform named PGSolver, which enabled an empirical evaluation of these algorithms and a better understanding of their relative merits.
Solving Parity Games in Practice
A generic solver is presented that intertwines optimisations with any of the existing parity game algorithms which is only called on parts of a game that cannot be solved faster by simpler methods, showing that using this approach vastly speeds up the solving process.
Oink: an Implementation and Evaluation of Modern Parity Game Solvers
A new and easy to extend tool Oink is implemented, which is a high-performance implementation of modern parity game algorithms and solvers, both on real world benchmarks and randomly generated games.
An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
An acceleration technique is presented that, while leaving the worst-case complexity unchanged, often leads to considerable speed-ups in games arising in practice, and of the symbolic implementation of the classical µ-calculus algorithm of Emerson and Jutla.
Improving Priority Promotion for Parity Games
A new instantiation, called region recovery, is proposed that tries to reduce the possible exponential behaviours exhibited by the original method in the worst case, and not only often outperforms the original priority promotion approach, but so far no exponential worst case is known.
Small Progress Measures for Solving Parity Games
A new algorithm for deciding the winner in parity games, and hence also for the modal µ-calculus model checking, based on a notion of game progress measures, characterized as pre-fixed points of certain monotone operators on a complete lattice.
A Delayed Promotion Policy for Parity Games
A new instantiation, called delayed promotion, is proposed that tries to reduce the possible exponential behaviours exhibited by the original method in the worst case, and not only often outperforms the original priority promotion approach, but so far no exponential worst case is known.
Improved Set-based Symbolic Algorithms for Parity Games
This work presents two set-based symbolic algorithms for parity games that requires at most a sub-exponential number of symbolic operations and develops an algorithm that requires $O(n^{c/3+1})$ symbolic Operations and only linear space.
An ordered approach to solving parity games in quasi polynomial time and quasi linear space
A first implementation for a quasi-polynomial algorithm is provided, and a number of side results are provided, including minor algorithmic improvements, a quasi bi-linear complexity in the number of states and edges for a fixed number of colours, and matching lower bounds for the algorithm of Calude et al.
Solving Parity Games via Priority Promotion
A new algorithm is proposed for the solution of this decision problem, based on the idea of promoting vertexes to higher priorities during the search for winning regions, exhibiting the best space complexity among the currently known solutions.