Process versus Unfolding Semantics for Place/Transition Petri Nets (1996)
| Venue: | Theoretical Computer Science |
| Citations: | 24 - 15 self |
BibTeX
@ARTICLE{Meseguer96processversus,
author = {José Meseguer and Ugo Montanari and Vladimiro Sassone},
title = {Process versus Unfolding Semantics for Place/Transition Petri Nets},
journal = {Theoretical Computer Science},
year = {1996},
volume = {153},
pages = {153--1}
}
Years of Citing Articles
OpenURL
Abstract
. In the last few years, the semantics of Petri nets has been investigated in several di#erent 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 DecOcc, 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...







