Axiomatizing Petri Net Concatenable Processes
At 10th Conference on Fundamentals of Computation Theory, FCT '95..
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.
Conference or Workshop Item
|Venue - Dates:
||10th Conference on Fundamentals of Computation Theory, FCT '95., 1995-01-01
||petri nets, petri nets processes, categorical semantics, symmetric monoidal categories
||Web & Internet Science
||12 Feb 2006
||17 Apr 2017 21:50
|Further Information:||Google Scholar|
Actions (login required)