State space reduction using partial order techniques
From MaRDI portal
Publication:1856177
DOI10.1007/s100090050035zbMath1065.68506OpenAlexW1999288406MaRDI QIDQ1856177
M. Minea, Edmund M. Clarke, Orna Grumberg, Doron A. Peled
Publication date: 1999
Published in: International Journal on Software Tools for Technology Transfer. STTT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s100090050035
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computer system organization (68M99)
Related Items (16)
Stateless model checking under a reads-value-from equivalence ⋮ Question-guided stubborn set methods for state properties ⋮ Stateless model checking for TSO and PSO ⋮ A stable non-interleaving early operational semantics for the pi-calculus ⋮ A pragmatic approach to stateful partial order reduction ⋮ The sweep-line state space exploration method ⋮ Producing Short Counterexamples Using “Crucial Events” ⋮ From the happened-before relation to the causal ordered set abstraction ⋮ Data flow analysis of asynchronous systems using infinite abstract domains ⋮ On the Origin of Events: Branching Cells as Stubborn Sets ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus ⋮ Approximate partial order reduction ⋮ Optimising the ProB model checker for B using partial order reduction ⋮ Exploring the Scope for Partial Order Reduction ⋮ Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks ⋮ Partial Order Reduction for Rewriting Semantics of Programming Languages
This page was built for publication: State space reduction using partial order techniques