An Axiomatization of the Algebra of Petri Net Concatenable Processes
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 abs...
Main Author: | Sassone, V. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
1996.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
An Axiomatization of the Category of Petri Net Computations
by: Sassone, V.
Published: (1998) -
On the Algebraic Structure of Petri Nets
by: Sassone, V.
Published: (2000) -
Process versus Unfolding Semantics for Place/Transition Petri Nets
by: Meseguer, J., et al.
Published: (1996) -
An algebra of high level Petri nets
by: Hall, Jon G.
Published: (1996) -
Functorial Models for Petri Nets
by: Bruni, R., et al.
Published: (2001)