Three-valued abstractions of markov chains: Completeness for a sizeable fragment of PCTL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5699 LNCS, Issue , 2009, Pages 205-216

  Huth, Michael ^a   Piterman, Nir ^a   Wagner, Daniel ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT SEMANTICS; FINITE-STATE ABSTRACTION; MARKOV CHAIN; PROBABILISTIC SIMULATION; THREE-VALUED; UNFOLDINGS;

COMPUTATION THEORY; MARKOV PROCESSES; SEMANTICS;

ABSTRACTING;

EID: 70350656207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03409-1_19     Document Type: Conference Paper

References (13)

1. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6, 512-535 (1994)
2. Kwiatkowska, M.: Model checking for probability and time: From theory to practice. In: Proc. of LICS 2003. IEEE Computer Society Press, Los Alamitos (2003)
3. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94, 1-28 (1991)
4. Jonsson, B., Larsen, K.: Specification and refinement of probabilistic processes. In: Proc. of LICS 1991. IEEE Computer Society Press, Los Alamitos (1991)
5. Fecher, H., Leucker, M., Wolf, V.: Don't know in probabilistic systems. In: SPIN Workshop on Model Checking of Software (2006)
6. Fecher, H., Huth, M., Piterman, N., Wagner, D.: Hintikka Games for PCTL on Labeled Markov Chains. In: Proc. of QEST 2008. IEEE Computer Society, Los Alamitos (2008)
7. Kattenbelt, M., Huth, M.: Abstraction Framework for Markov Decision Processes and PCTL Via Games. Technical Report RR-09-01, Oxford University Computing Laboratory (2009)
8. Kemeny, J., Snell, J., Knapp, A.: Denumerable Markov Chains. Springer, Heidelberg (1976)
9. Kleene, S.: Introduction to Metamathematics. Van Nostrand (1952)
10. Godefroid, P., Huth, M., Jagadeesan, R.: Abstraction-based model checking using modal transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, p. 426. Springer, Heidelberg (2001)
11. Huth, M.: On finite-state approximants for probabilistic computation tree logic. Theoretical Computer Science 346, 113-134 (2005)
12. Dams, D., Namjoshi, K.: The existence of finite abstractions for branching time model checking. In: Proc. of LICS 2004. IEEE Computer Society Press, Los Alamitos (2004)
13. Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 499-513. Springer, Heidelberg (1995)