Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bisimulation through probabilistic testing
Information and Computation
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
An improvement in formal verification
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Static Partial Order Reduction
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Weak Bisimulation is Sound and Complete for PCTL*
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A partial order approach to branching time logic model checking
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Probabilistic symbolic model checking with PRISM: a hybrid approach
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Partial Order Reduction for Probabilistic Systems
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Partial Order Reduction on Concurrent Probabilistic Programs
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Quantitative analysis of distributed randomized protocols
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Quantitative Analysis under Fairness Constraints
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
On-the-fly stuttering in the construction of deterministic ω-automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
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 methods for statistical model checking and simulation
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Model-checking and simulation for stochastic timed systems
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
A general framework for probabilistic characterizing formulae
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Heuristics for probabilistic timed automata with abstraction refinement
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Simulation and statistical model checking for modestly nondeterministic models
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Confluence reduction for markov automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Automated rare event simulation for stochastic petri nets
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
A property-based abstraction framework for SysML activity diagrams
Knowledge-Based Systems
| Hi-index | 0.00 |
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.