Markov automata are a compositional modelling formalism with continuous stochastic time, discrete probabilities, and nondeterministic choices. In our QEST 2019 paper titled "A Modest Approach to Modelling and Checking Markov Automata", we present extensions to the Modest language and the 'mcsta' model checker of the Modest Toolset to describe and analyse Markov automata models. The verification of Markov automata models requires dedicated algorithms for time-bounded probabilistic reachability and long-run average rewards. In the paper, we describe several recently developed such algorithms as implemented in 'mcsta' and evaluate them on a comprehensive set of benchmarks. Our evaluation shows that 'mcsta' improves the performance and scalability of Markov automata model checking compared to earlier and alternative tools. This artifact contains (1) the version of 'mcsta' and (2) the model files used for our experiments, (3) the raw experimental results, and (4) Linux scripts to replicate the experiments.
Markov processes, Probabilistic verification, Computation theory and mathematics, Computer software