Probabilistic Bisimulations for PCTL Model Checking of Interval MDPs

Vahid Hashemi
Hassan Hatefi
Jan Krčál

Verification of PCTL properties of MDPs with convex uncertainties has been investigated recently by Puggelli et al. However, model checking algorithms typically suffer from state space explosion. In this paper, we address probabilistic bisimulation to reduce the size of such an MDPs while preserving PCTL properties it satisfies. We discuss different interpretations of uncertainty in the models which are studied in the literature and that result in two different definitions of bisimulations. We give algorithms to compute the quotients of these bisimulations in time polynomial in the size of the model and exponential in the uncertain branching. Finally, we show by a case study that large models in practice can have small branching and that a substantial state space reduction can be achieved by our approach.

In Étienne André and Goran Frehse: Proceedings 1st International Workshop on Synthesis of Continuous Parameters (SynCoP 2014), Grenoble, France, 6th April 2014, Electronic Proceedings in Theoretical Computer Science 145, pp. 19–33.
Published: 31st March 2014.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: