Automated verification techniques for stochastic games allow formal reasoning about
systems that feature competitive or collaborative behaviour among rational agents in …

The de-facto standard approach in MDP verification is based on value iteration (VI). We
propose compositional VI, a framework for model checking compositional MDPs, that …

The classical problem of reachability in simple stochastic games is typically solved by value
iteration (VI), which produces a sequence of under-approxima-tions of the value of the …

A classic solution technique for Markov decision processes (MDP) and stochastic games
(SG) is value iteration (VI). Due to its good practical performance, this approximative …

Simple stochastic games are turn-based 2½-player zero-sum graph games with a
reachability objective. The problem is to compute the winning probabilities as well as the …

We study turn-based stochastic zero-sum games with lexicographic preferences over
objectives. Stochastic games are standard models in control, verification, and synthesis of …

This paper presents an efficient procedure for multi-objective model checking of long-run
average reward (aka: mean pay-off) and total reward objectives as well as their combination …

Probabilistische Systeme werden von Umgebungsereignissen beeinflusst, welche mit einer
gewissen Wahrscheinlichkeit auftreten. Damit solche Systeme einwandfrei funktionieren …

Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in
theoretical computer science, notably as a framework for reactive synthesis. Optimal …

Solving stochastic games with the reachability objective is a fundamental problem,
especially in quantitative verification and synthesis. For this purpose, bounded value …