An Axiomatization of the Algebra of Petri Net Concatenable Processes


Sassone, V. (1996) An Axiomatization of the Algebra of Petri Net Concatenable Processes Theoretical Computer Science, 170, (1-2), pp. 277-296.

Download

[img] PDF P-of-N-Off.pdf - Other
Download (888kB)

Description/Abstract

The concatenable processes of a Petri net $N$ can be characterized abstractly as the arrows of a symmetric monoidal category $Pn(N)$. However, this is only a partial axiomatization, since it is based on a concrete, ad hoc chosen, category of symmetries $Sym_N$. In this paper we give a completely abstract characterization of the category of concatenable processes of $N$, thus yielding an axiomatic theory of the noninterleaving behaviour of Petri nets.

Item Type: Article
ISSNs: 0304-3975 (print)
Keywords: petri nets, petri nets processes, categorical semantics, symmetric monoidal categories
Organisations: Web & Internet Science
ePrint ID: 261820
Date :
Date Event
1996Published
Date Deposited: 26 Jan 2006
Last Modified: 17 Apr 2017 21:52
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/261820

Actions (login required)

View Item View Item