Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers

DOI10.1007/978-3-642-04081-8_23zbMath1254.68149MaRDI QIDQ3184684

Sergio Giro, Luis María Ferrer Fioriti, Pedro R. D'Argenio

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_23

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Stuttering for abstract probabilistic automata, Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms, A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time, A General Framework for Probabilistic Characterizing Formulae, Confluence Reduction for Probabilistic Systems, Stuttering for Abstract Probabilistic Automata

Uses Software

• PRISM
• SPIN
• LiQuor
• Rapture

Cites Work

• Unnamed Item
• Switched PIOA: parallel composition via distributed scheduling
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Reactive, generative, and stratified models of probabilistic processes
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Model checking of probabilistic and nondeterministic systems
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• Partial-order reduction in symbolic state-space exploration