Parity games have important practical applications in formal verification and synthesis,
especially to solve the model-checking problem of the modal mu-calculus. They are also …

Parity games are simple two-player games of perfect information played on directed graphs
whose nodes are labeled with priorities. The name parity game is due to the fact that the …

We report on COOL-MC, a model checking tool for fixpoint logics that is parametric in the
branching type of models (non-deterministic, game-based, probabilistic etc.) and in the next …

We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-
free $\mu $-calculus. The algorithm supports global caching with intermediate propagation …

Parity games have important practical applications in formal verification and reactive
synthesis. Solving parity games is equal to solving the model-checking problem of the modal …

In this thesis, we consider the problem of solving two player infinite games, such as parity
games, mean-payoff games, and discounted games, the problem of solving Markov decision …

The problem of solving a parity game is at the core of many problems in model checking,
satisfiability checking and program synthesis. Some of the best algorithms for solving parity …

In this paper, we study how to make software controller synthesis more efficient and easy to
use for engineers. In order to simplify specifying a system, we believe that existing …

While many problems can be reduced to solving parity games, see [FL10] for example,
verification frameworks using parity game solvers as a backend technology seem quite …

The central point of this thesis is the implementation of the Scala Parity Game Solver a
collection of tools for solving parity games and experimental comparison of parity games …