We present the probabilistic model checker Storm. Storm supports the analysis of discrete-
and continuous-time variants of both Markov chains and Markov decision processes. Storm …

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

For decades, two-player (antagonistic) games on graphs have been a framework of choice
for many important problems in theoretical computer science. A notorious one is controller …

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

The analysis of formal models that include quantitative aspects such as timing or
probabilistic choices is performed by quantitative verification tools. Broad and mature tool …

We study turn-based stochastic zero-sum games with lexicographic preferences over
reachability and safety objectives. Stochastic games are standard models in control …

We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-
making in presence of an antagonistic opponent in a random environment. In this setting, an …

The analysis of formal models that include quantitative aspects such as timing or
probabilistic choices is performed by quantitative verification tools. Broad and mature tool …

We present a new approach for synthesising Paretooptimal Markov decision process (MDP)
policies that satisfy complex combinations of quality-of-service (QoS) software requirements …

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 …