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 …

Computing reachability probabilities is at the heart of probabilistic model checking. All model
checkers compute these probabilities in an iterative fashion using value iteration. This …

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 …

Markov automata (MAs) extend labelled transition systems with random delays and
probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution …

Distributed systems exhibit probabilistic and non-deterministic behaviors and may have time
constraints. Probabilistic Timed Rebeca (PTRebeca) is introduced as a timed and …

Markov automata are a compositional modelling formalism with continuous stochastic time,
discrete probabilities, and nondeterministic choices. In this article, we present extensions to …

Reliability, availability, maintenance and safety (RAMS) analysis is essential in the
evaluation of safety critical systems like nuclear power plants and the railway infrastructure …

Markov automata combine non-determinism, probabilistic branching, and exponentially
distributed delays. This compositional variant of continuous-time Markov decision processes …

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 …

Markov automata are a powerful formalism for modelling systems which exhibit
nondeterminism, probabilistic choices and continuous stochastic timing. We consider the …