This paper presents a new lower bound for the discrete strategy improvement algorithm for
solving parity games due to Voege and Jurdzinski. First, we informally show which structures …

Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest
among the many existing parity game algorithms. However, its complexity is exponential …

We study observation-based strategies for two-player turnbased games played on graphs
with parity objectives. An observationbased strategy relies on imperfect information about …

There is a wide range of modal logics whose semantics goes beyond relational structures,
and instead involves, eg, probabilities, multi-player games, weights, or neighbourhood …

We propose a benchmark suite for parity games that includes the benchmarks that have
been used in the literature, and make it available online. We give an overview of the parity …

We consider a controller synthesis problem in turnbased stochastic games with both a
qualitative linear temporal logic (LTL) constraint and a quantitative discounted-sum …

Parity games are infinite two-player games played on node-weighted directed graphs.
Formal verification problems such as verifying and synthesizing automata, bounded model …

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 …

Reinforcement learning (RL) algorithms have been used to learn how to implement tasks in
uncertain and partially unknown environments. In practice, environments are usually …

Parity games are abstract infinite-round games that take an important role in formal
verification. In the basic setting, these games are two-player, turn-based, and played under …