Process versus Unfolding Semantics for Place/Transition Petri Nets

Meseguer, J., Montanari, U. and Sassone, V. (1996) Process versus Unfolding Semantics for Place/Transition Petri Nets Theoretical Computer Science, 153, (1-2), pp. 171-210.


[img] PDF proc-unf-Off.pdf - Other
Download (3MB)


In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical ``token game,'' one can model the behaviour of Petri nets via non-sequential processes, via unfolding constructions, which provide formal relationships between nets and domains, and via algebraic models, which view Petri nets as essentially algebraic theories whose models are monoidal categories. In this paper we show that these three points of view can be reconciled. In our formal development a relevant role is played by $cDecOcc$, a category of occurrence nets appropriately decorated to take into account the history of tokens. The structure of decorated occurrence nets at the same time provides natural unfoldings for Place/Transition (PT) nets and suggests a new notion of processes, the decorated processes, which induce on Petri nets the same semantics as that of unfolding. In addition, we prove that the decorated processes of a net can be axiomatized as the arrows of a symmetric monoidal category which, therefore, provides the aforesaid unification.

Item Type: Article
ISSNs: 0304-3975 (print)
Keywords: petri nets non-sequential processes, petri nets unfoldings, petri nets semantics, models for concurrency, concurrency
Organisations: Web & Internet Science
ePrint ID: 261818
Date :
Date Event
Date Deposited: 26 Jan 2006
Last Modified: 17 Apr 2017 21:52
Further Information:Google Scholar

Actions (login required)

View Item View Item