An Axiomatization of the Algebra of Petri Net Concatenable Processes

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

Full description

Bibliographic Details
Main Author: Sassone, V. (Author)
Format: Article
Language:English
Published: 1996.
Subjects:
Article
Online Access:Get fulltext
Description
Summary: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.

Similar Items