Chapter

Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems

Volume 8453 of the series Lecture Notes in Computer Science pp 87-116

On Abstraction of Probabilistic Systems

  • Christian DehnertAffiliated withSoftware Modeling and Verification Group, RWTH Aachen University
  • , Daniel GeblerAffiliated withDepartment of Computer Science, VU University Amsterdam
  • , Michele VolpatoAffiliated withInstitute for Computing and Information Sciences, Radboud University
  • , David N. JansenAffiliated withInstitute for Computing and Information Sciences, Radboud University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Probabilistic model checking extends traditional model checking by incorporating quantitative information about the probability of system transitions. However, probabilistic models that describe interesting behavior are often too complex for straightforward analysis. Abstraction is one way to deal with this complexity: instead of analyzing the (“concrete”) model, a simpler (“abstract”) model that preserves the relevant properties is built and analyzed. This paper surveys various abstraction techniques proposed in the past decade. For each abstraction technique we identify in what sense properties are preserved or provide alternatively suitable boundaries.