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 abstract characterization of the category of concatenable processes of

$N$ , thus yielding an axiomatic theory of the noninterleaving behaviour of Petri nets.

petri nets, petri nets processes, categorical semantics, symmetric monoidal categories

0304-3975

277-296

Sassone, V.

df7d3c83-2aa0-4571-be94-9473b07b03e7

1996

Sassone, V.

df7d3c83-2aa0-4571-be94-9473b07b03e7

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.