The University of Southampton
University of Southampton Institutional Repository

# 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.

Record type: Article

## 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.

PDF P-of-N-Off.pdf - Other

Published date: 1996
Keywords: petri nets, petri nets processes, categorical semantics, symmetric monoidal categories
Organisations: Web & Internet Science

## Identifiers

Local EPrints ID: 261820
URI: https://eprints.soton.ac.uk/id/eprint/261820
ISSN: 0304-3975
PURE UUID: 5cea478f-fdd8-4ae1-9c1c-63fc7328b2c4

## Catalogue record

Date deposited: 26 Jan 2006

## Contributors

Author: V. Sassone