Automated Verification Techniques for Probabilistic Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2011

Automated Verification Techniques for Probabilistic Systems


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.
Fichier principal
Vignette du fichier
sfm11.pdf (912.91 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00648037 , version 1 (04-12-2011)


  • HAL Id : hal-00648037 , version 1


Vojtech Forejt, Marta Kwiatkowska, Gethin Norman, David Parker. Automated Verification Techniques for Probabilistic Systems. M. Bernardo and V. Issarny. Formal Methods for Eternal Networked Software Systems (SFM'11), LNCS 6659, Springer, pp.53--113, 2011. ⟨hal-00648037⟩


116 View
778 Download


Gmail Facebook X LinkedIn More