Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Theoretical Computer Science
Using partial orders for the efficient verification of deadlock freedom and safety properties
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
The Book of Traces
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Dynamic partial-order reduction for model checking software
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Explicit State Model Checking for Graph Grammars
Concurrency, Graphs and Models
Cartesian partial-order reduction
Proceedings of the 14th international SPIN conference on Model checking software
Model checking dynamic states in GROOVE
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
TransDPOR: a novel dynamic partial-order reduction technique for testing actor programs
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.01 |
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This means that the algorithm is suited for a setting in which resources, such as processes or objects, are dynamically created and destroyed, without an a prioribound. The algorithm relies on abstract enabling and disabling relations among actions, rather than associated sets of concurrent processes. It works by selecting so-called probe setsat every state, and backtracking in case the probe is later discovered to have missed some possible continuation.We show that this improves the potential reduction with respect to persistent sets. We then instantiate the framework by assuming that states are essentially sets of entities(out of a countable universe) and actions test, delete and create such entities. Typical examples of systems that can be captured in this way are Petri nets and (more generally) graph transformation systems. We show that all the steps of the algorithm, including the estimation of the missed actions, can be effectively implemented for this setting.