Handbook of logic in computer science (vol. 4)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Dynamic partial-order reduction for model checking software
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical application of geometric semantics to static analysis of concurrent programs
CONCUR 2005 - Concurrency Theory
Future Path-components in Directed Topology
Electronic Notes in Theoretical Computer Science (ENTCS)
An algorithm for direct construction of complete merged processes
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Branching processes of general petri nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Rigorous evidence of freedom from concurrency faults in industrial control software
SAFECOMP'11 Proceedings of the 30th international conference on Computer safety, reliability, and security
Building Tight Occurrence Nets from Reveals Relations
ACSD '11 Proceedings of the 2011 Eleventh International Conference on Application of Concurrency to System Design
Concurrent automata vs. asynchronous systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Trace spaces: an efficient new technique for state-space reduction
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Formal Relationships Between Geometrical and Classical Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Verifying that a concurrent program satisfies a given property, such as deadlock-freeness, is computationally difficult. Naive exploration techniques are facing the state space explosion problem: they consider an exponential number of interleavings of parallel threads (relative to the program size). Partial order reduction is a standard method to address this difficulty. It is based on the observation that certain sets of instructions, called persistent sets, are not affected by other concurrent instructions and can thus always be explored first when searching for deadlocks. More recent models of concurrent processes use directed topological spaces: states are points, computations are paths, and equivalent interleavings are homotopic. This geometric approach applies theoretical results of algebraic topology to improve verification. Despite the very different origin of the approaches, the paper compares partial-order reduction with a construction of the geometric approach, the category of future components. The main result, which shows that the two techniques make essentially the same use of persistent transitions, is of foundational interest and aims for cross-fertilization of the two approaches to improve verification methods for concurrent programs.