Partial Order Reducction for Probabilistic Branching Time

CHRISTEL BAIER; PEDRO R. D'ARGENIO; MARKUS GRÖßER

Edinburgh, Scotland

Workshop; 3rd Workshop of Quantitative Aspects of Programming Languages (QAPL'05); 2005

In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both linear time and branching time specifications, methods have been developed to apply partial order reduction in the context of model checking. Only recently, results were published that give criteria on applying partial order reduction for verifying quantitative linear time properties for probabilistic systems. This paper presents partial order reduction criteria for Markov decision processes and branching time properties, such as formulas of probabilistic computation tree logic. Moreover, we provide a comparison of the results established so far about reduction conditions for Markov decision processes.