ProbMela and verification of Markov decision processes
ACM SIGMETRICS Performance Evaluation Review
Quantitative analysis of distributed randomized protocols
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Quantitative Analysis under Fairness Constraints
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Partial Order Reduction for Probabilistic Branching Time
Electronic Notes in Theoretical Computer Science (ENTCS)
Performance evaluation and model checking join forces
Communications of the ACM
On model checking techniques for randomized distributed systems
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Confluence reduction for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On reduction criteria for probabilistic reward models
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Confluence reduction for markov automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.02 |
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.