ModelChecking ωRegular Properties of Interval Markov Chains
 Krishnendu Chatterjee,
 Koushik Sen,
 Thomas A. Henzinger
 … show all 3 hide
Abstract
We study the problem of model checking Intervalvalued Discretetime Markov Chains (IDTMC). IDTMCs are discretetime finite Markov Chains for which the exact transition probabilities are not known. Instead in IDTMCs, each transition is associated with an interval in which the actual transition probability must lie. We consider two semantic interpretations for the uncertainty in the transition probabilities of an IDTMC. In the first interpretation, we think of an IDTMC as representing a (possibly uncountable) family of (classical) discretetime Markov Chains, where each member of the family is a Markov Chain whose transition probabilities lie within the interval range given in the IDTMC. We call this semantic interpretation Uncertain Markov Chains (UMC). In the second semantics for an IDTMC, which we call Interval Markov Decision Process (IMDP), we view the uncertainty as being resolved through nondeterminism. In other words, each time a state is visited, we adversarially pick a transition distribution that respects the interval constraints, and take a probabilistic step according to the chosen distribution. We introduce a logic ωPCTL that can express liveness, strong fairness, and ωregular properties (such properties cannot be expressed in PCTL). We show that the ωPCTL model checking problem for Uncertain Markov Chain semantics is decidable in PSPACE (same as the best known upper bound for PCTL) and for Interval Markov Decision Process semantics is decidable in coNP (improving the previous known PSPACE bound for PCTL). We also show that the qualitative fragment of the logic can be solved in coNP for the UMC interpretation, and can be solved in polynomial time for a subclass of UMCs. We also prove lower bounds for these model checking problems. We show that the model checking problem of IDTMCs with LTL formulas can be solved for both UMC and IMDP semantics by reduction to the model checking problem of IDTMC with ωPCTL formulas.
 Bianco, A., Alfaro, L. Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. eds. (1995) Foundations of Software Technology and Theoretical Computer Science. Springer, Heidelberg
 Canny, J. (1988) Some algebraic and geometric computations in PSPACE. STOC 1988. ACM, New York, pp. 460467 CrossRef
 Chatterjee, K., Alfaro, L., Henzinger, T. (2004) Trading memory for randomness. QEST 2004. IEEE, Los Alamitos
 Chatterjee, K., Jurdziński, M., Henzinger, T.: Quantitative stochastic parity games. In: SODA 2004, ACMSIAM (2004)
 Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGrawHill (1990)
 Courcoubetis, C., Yannakakis, M. (1995) The complexity of probabilistic verification. Journal of ACM 42: pp. 857907 CrossRef
 de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (1997)
 Fecher, H., Leucker, M., Wolf, V. Don’t know in probabilistic systems. In: Valmari, A. eds. (2006) Model Checking Software. Springer, Heidelberg CrossRef
 Hansson, H., Jonsson, B. (1994) A logic for reasoning about time and reliability. Formal Aspects of Computing 6: pp. 512535 CrossRef
 Hopcroft, J.E., Ullman, J.D. (1979) Introduction to Automata Theory, Languages and Computation. AddisonWesley, Reading, MA
 Jonsson, B., Larsen, K.G. (1991) Specification and refinement of probabilistic processes. LICS 1991. IEEE, Los Alamitos
 Kemeny, J., Snell, J., Knapp, A. (1976) Denumerable Markov chains. Springer, Heidelberg
 Kozine, I.O., Utkin, L.V. (2002) Intervalvalued finite Markov chains. Reliable Computing 8: pp. 97113 CrossRef
 Kuznetsov, V.P.: Interval statistical models. Radio and Communication (1991)
 Rutten, J., Kwiatkowska, M., Norman, G., Parker, D.: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. American Mathematical Society (2004)
 Safra, S.: Complexity of automata on infinite objects. PhD thesis, Weizmann Institute of Science (1989)
 Segala, R.: Modeling and Verification of Randomized Distributed RealTime Systems. PhD thesis, MIT (1995)
 Sen, K., Viswanathan, M., Agha, G. Modelchecking Markov chains in the presence of uncertainties. In: Hermanns, H., Palsberg, J. eds. (2006) Tools and Algorithms for the Construction and Analysis of Systems. Springer, Heidelberg CrossRef
 Thomas, W. (1997) Languages, automata, and logic. Handbook of Formal Languages. Springer, Heidelberg
 Vardi, M., Wolper, P. (1986) An automatatheoretic approach to automatic program verification. LICS 1986. IEEE, Los Alamitos
 Vardi, M.Y. (1985) Automatic verification of probabilistic concurrent finitestate programs. FOCS 1985. IEEE, Los Alamitos
 Walley, P. (1996) Measures of uncertainty in expert systems. Artificial Intelligence 83: pp. 158 CrossRef
 Title
 ModelChecking ωRegular Properties of Interval Markov Chains
 Book Title
 Foundations of Software Science and Computational Structures
 Book Subtitle
 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29  April 6, 2008. Proceedings
 Pages
 pp 302317
 Copyright
 2008
 DOI
 10.1007/9783540784999_22
 Print ISBN
 9783540784975
 Online ISBN
 9783540784999
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 4962
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Krishnendu Chatterjee ^{(1)}
 Koushik Sen ^{(1)}
 Thomas A. Henzinger ^{(1)} ^{(2)}
 Author Affiliations

 1. University of California, Berkeley, USA
 2. EPFL, Switzerland
Continue reading...
To view the rest of this content please follow the download PDF link above.