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.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Download (206Kb) |
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) |
|---|---|
| ISBNs: | 3540602496 |
| Keywords: | petri nets, petri nets processes, categorical semantics, symmetric monoidal categories |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science |
| Item ID: | 261952 |
| Date Deposited: | 12 Feb 2006 |
| Last Modified: | 01 Mar 2012 23:51 |
| Contributors: | Sassone, V. (Author) |
| Date: | 1995 |
| Status: | Published |
| Publisher: | Springer |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/261952 |
Actions (login required)
 |
View Item |
