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

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 …

Probabilistic pushdown automata (pPDA) are a standard model for discrete probabilistic
programs with procedures and recursion. In pPDA, many quantitative properties are …

We present version 2.0 of the Partial Exploration Tool (Pet), a tool for verification of
probabilistic systems. We extend the previous version by adding support for stochastic …

We present a general framework for applying learning algorithms and heuristical guidance
to the verification of Markov decision processes (MDPs), based on the ideas of Br\'azdil, T. et …

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 …

This thesis presents the findings of a computational study on algorithms for Simple
Stochastic Games (SSG). Simple Stochastic Games are a restriction of the Shapley …

This open access book constitutes the proceedings of the 29th International Conference on
Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2023, which was …