Petri nets: an introduction
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Branching processes of Petri nets
Acta Informatica
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
An event structure semantics for general Petri nets
Theoretical Computer Science - Special volume on Petri nets
Contextual Petri nets, asymmetric event structures, and processes
Information and Computation
Geometric Logic, Causality and Event Structures
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A Generalized Event Structure for the Muller Unfolding of a Safe Net
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Domain and event structure semantics for Petri nets with read and inhibitor arcs
Theoretical Computer Science
The individual and collective token interpretations of Petri nets
CONCUR 2005 - Concurrency Theory
Trellis Processes: A Compact Representation for Runs of Concurrent Systems
Discrete Event Dynamic Systems
Executability of scenarios in Petri nets
Theoretical Computer Science
| Hi-index | 0.00 |
The notion of unfolding plays a major role in the so called non sequential semantics of Petri nets, as well as in model checking of concurrent and distributed systems or in control theory. In literature various approaches to this notion have been proposed, where dependencies among events are represented either taking into account the whole history of the event (the so called individual token philosophy) or considering the whole history irrelevant (the so called collective token philosophy). In this paper we propose two unfoldings where the history is partially kept. These notions are based on unravelling a net rather than unfolding it. We compare them with the classical ones and we put all of them together in a coherent framework.