Symmetry breaking in distributed networks
Information and Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Partial order reduction: linear and branching temporal logics and process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Distributed Algorithms
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Markov Decision Processes and Regular Events (Extended Abstract)
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Symbolic Model Checking for Probabilistic Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Temporal Logics for the Specification of Performance and Reliability
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Partial Order Reduction for Probabilistic Branching Time
Electronic Notes in Theoretical Computer Science (ENTCS)
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
| Hi-index | 0.00 |
A wide range of coordination protocols for distributed systems, internet protocols or systems with unreliable components can formally be modelled by Markov decision processes (MDP). MDPs can be viewed as a variant of state-transition diagrams with discrete probabilities and nondeterminism. While traditional model checking techniques for non-probabilistic systems aim to establish properties stating that all (or some) computations fulfill a certain condition, the verification problem for randomized systems requires reasoning about the quantitative behavior by means of properties that refer to the probabilities for certain computations, for instance, the probability to find a leader within 5 rounds or the probability for not reaching an error state.The paper starts with a brief introduction into modelling randomized systems with MDPs and the modelling language ProbMela which is a guarded command language with features of imperative languages, nondeterminism, parallelism, a probabilistic choice operator and lossy channels. We summarize the main steps for a quantitative analysis of MDPs against linear temporal logical specifications. The last part will report on the main features of the partial order reduction approach for MDPs and its implementation in the model checker LiQuor.