The formal analysis of critical systems is supported by a vast space of modelling formalisms
and tools. The variety of incompatible formats and tools however poses a significant …

Parity games play an important role in model checking and synthesis. In their paper, Calude
et al. have recently shown that these games can be solved in quasi-polynomial time. We …

Quantitative formal models capture probabilistic behaviour, real-time aspects, or general
continuous dynamics. A number of tools support their automatic analysis with respect to …

Quantitative verification tools compute probabilities, expected rewards, or steady-state
values for formal models of stochastic and timed systems. Exact results often cannot be …

Mungojerrie is an extensible tool that provides a framework to translate linear-time
objectives into reward for reinforcement learning (RL). The tool provides convergent RL …

This paper investigates the use of model-free reinforcement learning to compute the optimal
value in two-player stochastic games with parity objectives. In this setting, two decision …

In this paper, we present epmc, an extendible probabilistic model checker. epmc has a small
kernel, and is designed modularly. It supports discrete probabilistic models such as Markov …

It is well-known that the winning region of a parity game with n nodes and k priorities can be
computed as ak-nested fixpoint of a suitable function; straightforward computation of this …

Reinforcement learning synthesizes controllers without prior knowledge of the system. At
each timestep, a reward is given. The controllers optimize the discounted sum of these …

5 player parity games combine the challenges posed by 2.5 player reachability games and
the qualitative analysis of parity games. These two types of problems are best approached …