Quantitative properties of stochastic systems are usually specified in logics that allow one to
compare the measure of executions satisfying certain temporal properties with thresholds …

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 …

In control theory, complex models of physical processes, such as systems of differential or
difference equations, are usually checked against simple specifications, such as stability …

Interactive, distributed, and embedded systems often behave stochastically, for example,
when inputs, message delays, or failures conform to a probability distribution. However …

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 …

A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …

This tutorial presents an overview of model checking for both discrete and continuous-time
Markov chains (DTMCs and CTMCs). Model checking algorithms are given for verifying …

Building on concepts drawn from control theory, self-adaptive software handles
environmental and internal uncertainties by dynamically adjusting its architecture and …

Source control repositories, bug repositories, archived communications, deployment logs,
and code repositories are examples of software repositories that are commonly available for …