Randomization is a key element in sequential and distributed computing. Reasoning about
randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods …

We launch the new probabilistic model checker S torm. It features the analysis of discrete-
and continuous-time variants of both Markov chains and MDPs. It supports the P rism and …

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 …

Probabilistic model checking is a powerful technique for formally verifying quantitative
properties of systems that exhibit stochastic behaviour. Such systems are found in many …

This paper presents a new state-space generation approach for dynamic fault trees (DFTs)
that exploits several successful reduction techniques from the field of model checking. The …

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 …

We present an extensive collection of quantitative models to facilitate the development,
comparison, and benchmarking of new verification algorithms and tools. All models have a …

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

Probabilistic timed automata (PTAs) are a formalism for modelling systems whose behaviour
incorporates both probabilistic and real-time characteristics. Applications include wireless …

This paper considers the design-phase safety analysis of vehicle guidance systems. The
proposed approach constructs dynamic fault trees (DFTs) to model a variety of safety …