Two polygraphic presentations of Petri nets

Yves Guiraud (1)

1 IML - Institut de mathématiques de Luminy

This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first one sees places as generators of a commutative monoid and transitions as rewriting rules on it: this setting is totally equivalent to Petri nets, but lacks any graphical intuition. The second one considers places as 1-dimensional cells and transitions as 2-dimensional ones: this translation recovers a graphical meaning but raises many difficulties since it uses explicit permutations. Finally, the third translation sees places as degenerated 2-dimensional cells and transitions as 3-dimensional ones: this is a setting equivalent to Petri nets, equipped with a graphical interpretation.

Mots clés: Polygraph; n-Category; Petri net

Domaines: Logique [math.LO]; Catégories et ensembles [math.CT]; Logique en informatique [cs.LO]

Yves Guiraud. Two polygraphic presentations of Petri nets. Theoretical Computer Science, 2006, 360(1-3), pp.124-146. ⟨10.1016/j.tcs.2006.02.015⟩. ⟨hal-00092209⟩