Two polygraphic presentations of Petri nets
| dc.creator | Guiraud, Yves | |
| dc.date | 2006-12-04 | |
| dc.date.accessioned | 2026-07-07T07:38:34Z | |
| dc.date.available | 2026-07-07T07:38:34Z | |
| dc.description | 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. | |
| dc.description | 28 pages, 24 figures | |
| dc.identifier | https://arxiv.org/abs/math/0612088 | |
| dc.identifier | http://arxiv.org/abs/math/0612088 | |
| dc.identifier | Theoretical Computer Science, Volume 360, Issues 1-3, 21 August 2006, Pages 124-146 | |
| dc.identifier | doi:10.1016/j.tcs.2006.02.015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/121131 | |
| dc.subject | Category Theory | |
| dc.subject | Logic in Computer Science | |
| dc.title | Two polygraphic presentations of Petri nets | |
| dc.type | text |