The University of Southampton
University of Southampton Institutional Repository

An Axiomatization of the Algebra of Petri Net Concatenable Processes

Record type: Article

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
Download (888kB)

Citation

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

More information

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

Identifiers

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

Catalogue record

Date deposited: 26 Jan 2006
Last modified: 18 Jul 2017 08:58

Export record

Contributors

Author: V. Sassone

University divisions


Download statistics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×