Automated Verification Techniques for Probabilistic Systems
| Authors | |
|---|---|
| Year of publication | 2011 |
| Type | Article in Proceedings |
| Conference | Formal Methods for Eternal Networked Software Systems (SFM'11) |
| MU Faculty or unit | |
| Citation | FOREJT, Vojtěch, Marta KWIATKOWSKA, Gethin NORMAN and David PARKER. Automated Verification Techniques for Probabilistic Systems. In M. Bernardo and V. Issarny. Formal Methods for Eternal Networked Software Systems (SFM'11). Berlin, Germany: Springer, 2011, p. 53-113. ISBN 978-3-642-21454-7. Available from: https://dx.doi.org/10.1007/978-3-642-21455-4_3. |
| Doi | http://dx.doi.org/10.1007/978-3-642-21455-4_3 |
| Field | Informatics |
| Keywords | tutorial; pctl model checking; markov decision processes |
| Description | This tutorial provides an introduction to probabilistic model checking, a technique for automatically verifying quantitative properties of probabilistic systems. We focus on Markov decision processes (MDPs), which model both stochastic and nondeterministic behaviour. We describe methods to analyse a wide range of their properties, including specifications in the temporal logics PCTL and LTL, probabilistic safety properties and cost- or reward-based measures. We also discuss multi-objective probabilistic model checking, used to analyse trade-offs between several different quantitative properties. Applications of the techniques in this tutorial include performance and dependability analysis of networked systems, communication protocols and randomised distributed algorithms. Since such systems often comprise several components operating in parallel, we also cover techniques for compositional modelling and verification of multi-component probabilistic systems. Finally, we describe three large case studies which illustrate practical applications of the various methods discussed in the tutorial. |
| Related projects: |