Benchmarks for Parity Games (extended version)
arXiv:1407.3121 · doi:10.1007/978-3-319-24644-4_9
Abstract
We propose a benchmark suite for parity games that includes all benchmarks that have been used in the literature, and make it available online. We give an overview of the parity games, including a description of how they have been generated. We also describe structural properties of parity games, and using these properties we show that our benchmarks are representative. With this work we provide a starting point for further experimentation with parity games.
The corresponding tool and benchmarks are available from https://github.com/jkeiren/paritygame-generator. This is an extended version of the paper that has been accepted for FSEN 2015
References in corpus (4)
- An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
- Stuttering Equivalence for Parity Games
- A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
- Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds
Cited by in corpus (6)
- Oink: an Implementation and Evaluation of Modern Parity Game Solvers
- Attracting Tangles to Solve Parity Games
- Simple Fixpoint Iteration To Solve Parity Games
- A Comparison of BDD-Based Parity Game Solvers
- Partial Solvers for Parity Games: Effective Polynomial-Time Composition
- Efficient Parallel Strategy Improvement for Parity Games