Partial-Order Reduction

DOI10.1007/978-3-319-10575-8_6zbMath1392.68262OpenAlexW2803341075MaRDI QIDQ3176364

Doron A. Peled

Publication date: 20 July 2018

Published in: Handbook of Model Checking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10575-8_6

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Explicit-State Model Checking ⋮ Model Checking Security Protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stutter-invariant temporal properties are expressible without the next-time operator
• Combining partial-order reductions with on-the-fly model-checking.
• Characterizing finite Kripke structures in propositional temporal logic
• A calculus of communicating systems
• Defining conditional independence using collapses
• An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• A partial order approach to branching time logic model checking.
• Unfoldings: A partial-order approach to model checking.
• Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics
• On Commutativity Based Edge Lean Search
• Partial-order reduction in symbolic state-space exploration
• Relaxed visibility enhances partial order reduction

This page was built for publication: Partial-Order Reduction