Probabilistic Bisimulations for PCTL Model Checking of Interval MDPs (extended version)

Investor logo

Warning

This publication doesn't include Faculty of Sports Studies. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

HASHEMI Vahid HATEFI Hassan KRČÁL Jan

Year of publication 2014
Type Article in Proceedings
Conference Proceedings 1st International Workshop on Synthesis of Continuous Parameters
MU Faculty or unit

Faculty of Informatics

Citation
Web http://arxiv.org/abs/1403.2864v3
Doi http://dx.doi.org/10.4204/EPTCS.145.4
Field Informatics
Keywords probabilistic bisimulation; interval MDP
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info