Chapter

Tools and Algorithms for the Construction and Analysis of Systems

Volume 3920 of the series Lecture Notes in Computer Science pp 394-410

Model-Checking Markov Chains in the Presence of Uncertainties

  • Koushik SenAffiliated withDepartment of Computer Science, University of Illinois at Urbana-Champaign
  • , Mahesh ViswanathanAffiliated withDepartment of Computer Science, University of Illinois at Urbana-Champaign
  • , Gul AghaAffiliated withDepartment of Computer Science, University of Illinois at Urbana-Champaign

Abstract

We investigate the problem of model checking Interval-valued Discrete-time Markov Chains (IDTMC). IDTMCs are discrete-time 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) discrete-time Markov Chains, where each member of the family is a Markov Chain whose transition probabilities lie within the interval range given in the IDTMC. This semantic interpretation we call 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 non-determinism. 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 show that the PCTL model checking problem for both Uncertain Markov Chain semantics and Interval Markov Decision Process semantics is decidable in PSPACE. We also prove lower bounds for these model checking problems.