On the nature of events: another perspective in concurrency
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Symbolic Model Checking
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Unfolding semantics of graph transformation
Information and Computation
Unfolding-Based Diagnosis of Systems with an Evolving Topology
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Directed Unfolding of Petri Nets
Transactions on Petri Nets and Other Models of Concurrency I
McMillan's Complete Prefix for Contextual Nets
Transactions on Petri Nets and Other Models of Concurrency I
Unfolding grammars in adhesive categories
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Construction and SAT-based verification of contextual unfoldings
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Efficient contextual unfolding
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Efficient unfolding of contextual Petri nets
Theoretical Computer Science
Verification of petri nets with read arcs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.01 |
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for constructing a finite complete prefix of the unfolding of a safe Petri net, providing a compact representation of the reachability graph. The extension to contextual nets and graph transformation systems is far from being trivial because events can have multiple causal histories. Recently, we proposed an abstract algorithm that generalizes McMillan's construction to bounded contextual nets without resorting to an encoding into plain P/T nets. Here, we provide a more explicit construction that renders the algorithm effective. To allow for an inductive definition of concurrency, missing in the original proposal and essential for an efficient unfolding procedure, the key intuition is to associate histories not only with events, but also with places. Additionally, we outline how the proposed algorithm can be extended to graph transformation systems, for which previous algorithms based on the encoding of read arcs would not be applicable.