Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Markov decision processes and regular events
Proceedings of the seventeenth international colloquium on Automata, languages and programming
The complexity of probabilistic verification
Journal of the ACM (JACM)
Measures of uncertainty in expert systems
Artificial Intelligence
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem
Computational Optimization and Applications
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A faster PSPACE algorithm for deciding the existential theory of the reals
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
Artificial Intelligence
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Abstraction for Stochastic Systems by Erlang's Method of Stages
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Reachability for Parametric Markov Models
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Model-checking ω-regular properties of interval Markov chains
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A game-based abstraction-refinement framework for Markov decision processes
Formal Methods in System Design
Probabilistic model checking of biological systems with uncertain kinetic rates
Theoretical Computer Science
xTune: A formal methodology for cross-layer tuning of mobile embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
On the complexity of model checking interval-valued discrete time Markov chains
Information Processing Letters
Polynomial-Time verification of PCTL properties of MDPs with convex uncertainties
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Least upper bounds for probability measures and their applications to abstractions
Information and Computation
| Hi-index | 0.00 |
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.