Partial order reduction for probabilistic systems
Authors:
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 230-239
Abstract
In the past, several model checking algorithms have been proposed to verify probabilistic reactive systems. The techniques to combat the state-explosion problem have mainly concentrated on symbolic methods with variants of decision diagrams or abstraction methods. In this paper, we show how partial order reduction with a variant of Peled's ample set method can be applied in the context of LTL model checking for probabilistic systems modelled by Markov decision processes.Keywords
This publication has 21 references indexed in Scilit:
- Markov decision processes and regular events2005
- A stubborn attack on state explosion2005
- Abstraction and Probabilities for Hybrid LogicsElectronic Notes in Theoretical Computer Science, 2005
- Probabilistic symbolic model checking with PRISM: a hybrid approachInternational Journal on Software Tools for Technology Transfer, 2004
- On the use of MTBDDs for performability analysis and verification of stochastic systemsThe Journal of Logic and Algebraic Programming, 2003
- Deciding Bisimilarity and Similarity for Probabilistic ProcessesJournal of Computer and System Sciences, 2000
- The complexity of probabilistic verificationJournal of the ACM, 1995
- Probabilistic VerificationInformation and Computation, 1993
- Bisimulation through probabilistic testingInformation and Computation, 1991
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983