Axiomatizing Petri Net Concatenable Processes

Sassone, V. (1995) Axiomatizing Petri Net Concatenable Processes. In, 10th Conference on Fundamentals of Computation Theory, FCT '95. Springer, 414-423.


[img] PDF
Download (206Kb)


The concatenable processes of a Petri net $N$ can be characterized abstractly as the arrows of a symmetric monoidal category $P[N]$. Yet, this is only a partial axiomatization, since $P[N]$ is built on a concrete, ad hoc chosen, category of symmetries. In this paper we give a fully equational description of the category of concatenable processes of $N$, thus yielding an axiomatic theory of the noninterleaving behaviour of Petri nets.

Item Type: Conference or Workshop Item (Paper)
ISBNs: 3540602496
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: 261952
Accepted Date and Publication Date:
Date Deposited: 12 Feb 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