Don’t Know in Probabilistic Systems

  • Harald Fecher
  • Martin Leucker
  • Verena Wolf
Conference paper

DOI: 10.1007/11691617_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3925)
Cite this paper as:
Fecher H., Leucker M., Wolf V. (2006) Don’t Know in Probabilistic Systems. In: Valmari A. (eds) Model Checking Software. SPIN 2006. Lecture Notes in Computer Science, vol 3925. Springer, Berlin, Heidelberg

Abstract

In this paper the abstraction-refinement paradigm based on 3-valued logics is extended to the setting of probabilistic systems. We define a notion of abstraction for Markov chains. To be able to relate the behavior of abstract and concrete systems, we equip the notion of abstraction with the concept of simulation. Furthermore, we present model checking for abstract probabilistic systems (abstract Markov chains) with respect to specifications in probabilistic temporal logics, interpreted over a 3-valued domain. More specifically, we introduce a 3-valued version of probabilistic computation-tree logic (PCTL) and give a model checking algorithm w.r.t. abstract Markov chains.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Harald Fecher
    • 1
  • Martin Leucker
    • 2
  • Verena Wolf
    • 3
  1. 1.Institute of InformaticsUniversity of KielGermany
  2. 2.Institute of InformaticsTU MunichGermany
  3. 3.Institute of InformaticsUniversity of MannheimGermany

Personalised recommendations