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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baier, C.: On the algorithmic verification of probabilistic systems. Universität Mannheim, Habilitation Thesis (1998)
Chechik, M., Devereux, B., Easterbrook, S., Gurfinkel, A.: Multi-valued symbolic model-checking. ACM Transactions on Software Engineering and Methodology (TOSEM) 12, 371–408 (2003)
Clarke, E., Grumberg, O., Long, D.: Model Checking and Abstraction. In: Proc. of POPL, January 1992, pp. 342–354. ACM, New York (1992)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42(4), 857–907 (1995)
D’Argenio, P., Jeannet, B., Jensen, H., Larsen, K.: Reduction and refinement strategies for probabilistic analysis. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, pp. 57–76. Springer, Heidelberg (2002)
de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Technical report STAN-CS-TR-98-1601 (1997)
Godefroid, P., Jagadeesan, R.: On the expressiveness of 3-valued models. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 206–222. Springer, Heidelberg (2002)
Grumberg, O., Lange, M., Leucker, M., Shoham, S.: Don’t know in the μ-calculus. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 233–249. Springer, Heidelberg (2005)
Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6, 512–535 (1994)
Huth, M.: On finite-state approximants for probabilistic computation tree logic. Theoretical Computer Science (to appear)
Huth, M.: An abstraction framework for mixed non-deterministic and probabilistic systems. In: Validation of Stochastic Systems, pp. 419–444 (2004)
Huth, M., Jagadeesan, R., Schmidt, D.: Modal transition systems: A foundation for three-valued program analysis. In: Sands, D. (ed.) ESOP 2001. LNCS, vol. 2028, pp. 155–169. Springer, Heidelberg (2001)
Huth, M.: Abstraction and probabilities for hybrid logics. In: Qualitative Aspects of Programming Languages (2004)
Jonsson, B., Larsen, K.: Specification and refinement of probabilistic processes. In: Proc. 6th IEEE Int. Symp. on Logic in Computer Science (1991)
Konikowska, B., Penczek, W.: Model checking for multi-valued computation tree logics. In: Beyond two: theory and applications of multiple-valued logic, pp. 193–210. Physica-Verlag, Heidelberg (2003)
Konikowska, B., Penczek, W.: On designated values in multi-valued CTL ∗ model checking. Fundamenta Informaticae 60(1–4), 221–224 (2004)
Shoham, S., Grumberg, O.: A game-based framework for CTL counterexamplesand 3-valued abstraction-refinemnet. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 275–287. Springer, Heidelberg (2003)
van Glabbeek, R., Smolka, S., Steffen, B., Tofts, C.: Reactive, generative, and stratified models of probabilistic processes. In: Logic in Computer Science, pp. 130–141 (1990)
Yi, W.: Reasoning about uncertain information compositionally. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol. 863, Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/11691617_5
Download citation
DOI: https://doi.org/10.1007/11691617_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33102-5
Online ISBN: 978-3-540-33103-2
eBook Packages: Computer ScienceComputer Science (R0)