Solving Parity Games in Scala

  title={Solving Parity Games in Scala},
  author={Andrea Di Stasio and Aniello Murano and Vincenzo Prignano and Loredana Sorrentino},
Parity games are two-player games, played on directed graphs, whose nodes are labeled with priorities. Along a play, the maximal priority occurring infinitely often determines the winner. In the last two decades, a variety of algorithms and successive optimizations have been proposed. The majority of them have been implemented in PGSolver, written in OCaml, which has been elected by the community as the de facto platform to solve efficiently parity games as well as evaluate their performance in… 
Improving parity games in practice
This work deeply revisit the implementation of Zielonka’s recursive algorithm by dealing with the use of specific data structures and programming languages such as Scala, Java, C++, and Go, and shows that these choices are successful.
Concurrent Multi-Player Parity Games
This paper introduces and solves efficiently concurrent multi-player parity games where the players, being existential and universal, compete under fixed and strict alternate coalitions and shows that the problem of solving such games is in PSpace.
Benchmarks for Parity Games
With this work, a benchmark suite for parity games is proposed that includes the benchmarks that have been used in the literature, and it is shown that these benchmarks are representative.
Benchmarks for Parity Games (extended version)
With this work, a benchmark suite for parity games is proposed that includes all benchmarks that have been used in the literature, and it is shown that these benchmarks are representative.
On Promptness in Parity Games
Parity games are a powerful formalism for the automatic synthesis and verification of reactive systems and several parity game variants have been proposed, in which quantitative requirements are added to the classic qualitative ones.
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.
Toward a multilevel scalable parallel Zielonka's algorithm for solving parity games
The feasibility analysis of a multi‐grained parallel version of the Zielonka Recursive (ZR) algorithm exploiting the coarse‐ and fine‐ grained concurrency is performed and it is confirmed that while a fine‐Grained parallelism have a clear performance limitation, the performance gain one can get by employing a multilevel parallelism is significant.
On Games in Formal Verification
Nel Capitolo 1 facciamo uno studio generale del concetto di "prompt" applicato ai Parity Games. Tale studio permette di raggruppare diverse condizioni di parity, alcune introdotte da noi, altre gia


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.
Mean-payoff parity games
It is shown that optimal strategies exist in mean-payoff parity games, but they may require infinite memory.
Quantitative stochastic parity games
The existence of optimal pure memoryless strategies together with the polynomial-time solution for the one-player case implies that the quantitative two-player stochastic parity game problem is in NP ∩ co-NP, which generalizes a result of Condon for Stochastic games with reachability objectives.
Solving Parity Games on the GPU
These GPU-based implementations of three well-known algorithms for solving parity games are in general faster by a factor of at least two than the corresponding implementations found in the widely known PGSolver collection of solvers.
Deciding the Winner in Parity Games is in UP \cap co-Up
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.
Infinite Games Played on Finite Graphs
A Discrete Strategy Improvement Algorithm for Solving Parity Games
A discrete strategy improvement algorithm is given for constructing winning strategies in parity games, thereby providing also a new solution of the model-checking problem for the modal μ-calculus.
Solving parity games in big steps
  • S. Schewe
  • Computer Science
    J. Comput. Syst. Sci.
  • 2007
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees
  • W. Zielonka
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1998