Axiomatizing Petri Net Concatenable Processes


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

Download

[img] PDF P-of-N-conf.pdf - Other
Download (211kB)

Description/Abstract

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)
Venue - Dates: 10th Conference on Fundamentals of Computation Theory, FCT '95., 1995-01-01
Keywords: petri nets, petri nets processes, categorical semantics, symmetric monoidal categories
Organisations: Web & Internet Science
ePrint ID: 261952
Date :
Date Event
1995Published
Date Deposited: 12 Feb 2006
Last Modified: 17 Apr 2017 21:50
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/261952

Actions (login required)

View Item View Item