Partial Order Reduction for Probabilistic Branching Time

Share/Save/Bookmark

Baier, Christel and D'Argenio, Pedro and Größer, Marcus (2005) Partial Order Reduction for Probabilistic Branching Time. In: Third Workshop on Quantitative Aspects of Programming Languages, QAPL 2005, 23 May 2006, Edinburgh, Scotland (pp. pp. 97-116).

[img] PDF
Restricted to UT campus only
: Request a copy
442kB
Abstract: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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/63451
Official URL:http://dx.doi.org/10.1016/j.entcs.2005.10.034
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 248129