A geometric view of partial order reduction

DOI10.1016/j.entcs.2013.09.013zbMath1334.68133OpenAlexW2012793824WikidataQ113317962 ScholiaQ113317962MaRDI QIDQ265807

Eric Goubault, Samuel Mimram, Tobias Heindel

Publication date: 12 April 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2013.09.013

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Topological abstraction of higher-dimensional automata ⋮ Natural Homology ⋮ Geometric and combinatorial views on asynchronous computability

Uses Software

• SPIN

Cites Work

• Unnamed Item
• Unnamed Item
• Components of the fundamental category
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Components of the fundamental category. II
• Trace Spaces: An Efficient New Technique for State-Space Reduction
• An Algorithm for Direct Construction of Complete Merged Processes
• Branching Processes of General Petri Nets
• Future Path-components in Directed Topology
• Geometry and concurrency: a user's guide
• Formal Relationships Between Geometrical and Classical Models for Concurrency
• Dynamic partial-order reduction for model checking software
• Mathematical Foundations of Computer Science 2005
• CONCUR 2005 – Concurrency Theory

This page was built for publication: A geometric view of partial order reduction