Branching processes of Petri nets
Acta Informatica
On the nature of events: another perspective in concurrency
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Information and Computation
Contextual Petri nets, asymmetric event structures, and processes
Information and Computation
Symbolic Model Checking
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Reachability in contextual nets
Fundamenta Informaticae
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Invariant Semantics of Nets with Inhibitor Arcs
CONCUR '91 Proceedings of the 2nd 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
Contextual Occurence Nets and Concurrent Constraint Programming
Proceedings of the International Workshop on Graph Transformations in Computer Science
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
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
On the computation of McMillan's prefix for contextual nets and graph grammars
ICGT'10 Proceedings of the 5th international conference on Graph transformations
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
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
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Hi-index | 0.00 |
In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finite-state) Petri nets, which can be used for verification purposes. Contextual nets are a generalisation of Petri nets suited to model systems with read-only access to resources. When working with contextual nets, a finite complete prefix can be obtained by applying McMillan's construction to a suitable encoding of the contextual net into an ordinary net. However, it has been observed that if the unfolding is itself a contextual net, then the complete prefix can be significantly smaller than the one obtained with the above technique. A construction for generating such a contextual complete prefix has been proposed for a special class of nets, called read-persistent. In this paper, we propose an algorithm that works for arbitrary semi-weighted, bounded contextual nets. The construction explicitly takes into account the fact that, unlike in ordinary or read-persistent nets, an event can have several different histories in general contextual net computations.