On the Semantics of Place/Transition Petri Nets


Meseguer, J., Montanari, U. and Sassone, V. (1997) On the Semantics of Place/Transition Petri Nets. Mathematical Structures in Computer Science, 7, 359-397.

Download

[img] PDF
Download (309Kb)

Description/Abstract

Place/Transition (PT) Petri nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the `token game' is too intensional, even in its more abstract interpretations in terms of nonsequential processes and monoidal categories; on the other hand, Winskel's basic unfolding construction, which provides a coreflection between nets and finitary prime algebraic domains, works only for safe nets. In this paper we extend Winskel's result to PT nets. We start with a rather general category PTNets of PT nets, we introduce a category DecOcc of decorated (nondeterministic) occurrence nets and we define adjunctions between PTNets and DecOcc and between DecOcc and Occ, the category of occurrence nets. The role of DecOcc is to provide natural unfoldings for PT nets, i.e., acyclic safe nets where a notion of family is used for relating multiple instances of the same place. The unfolding functor from PTNets to Occ reduces to Winskel's when restricted to safe nets; moreover, the standard coreflection between Occ and Dom, the category of finitary prime algebraic domains, when composed with the unfolding functor above, determines a chain of adjunctions between PTNets and Dom.

Item Type: Article
Keywords: petri nets, petri nets unfoldings, petri nets processes, categorical semantics
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 261821
Date Deposited: 26 Jan 2006
Last Modified: 27 Mar 2014 20:04
Publisher: Cambridge University Press
Further Information:Google Scholar
ISI Citation Count:23
URI: http://eprints.soton.ac.uk/id/eprint/261821

Actions (login required)

View Item View Item