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), 277-296.


[img] PDF
Download (867Kb)


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
Keywords: petri nets, petri nets processes, categorical semantics, symmetric monoidal categories
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 261820
Accepted Date and Publication Date:
Date Deposited: 26 Jan 2006
Last Modified: 31 Mar 2016 14:04
Further Information:Google Scholar

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics