The design and control of autonomous systems that operate in uncertain or adversarial
environments can be facilitated by formal modeling and analysis. Probabilistic model …

We present a major new release of the PRISM-games model checker, featuring multiple
significant advances in its support for verification and strategy synthesis of stochastic games …

Abstract Model checking undiscounted reachability and expected-reward properties on
Markov decision processes (MDPs) is key for the verification of systems that act under …

Markov decision processes are widely used for planning and verification in settings that
combine controllable or adversarial choices with probabilistic behaviour. The standard …

Statistical model checking (SMC) is a technique for analysis of probabilistic systems that
may be (partially) unknown. We present an SMC algorithm for (unbounded) reachability …

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

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

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 …

Probabilistic model checking for stochastic games enables formal verification of systems that
comprise competing or collaborating entities operating in a stochastic environment. Despite …

In this paper, we present four alternative solution methods to Shapley iteration for the
solution of stochastic matrix games. We first combine the extended matrix norm method for …