Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs
Paolo Baldan, Andrea Corradini, Ugo Montanari · Electronic Notes in Theoretical Computer Science · 2005
It belongs to the folklore that graph grammars can be seen as a proper generalisation of Petri nets. In this paper we show how this intuitive relationship can be made formal. The double-pushout approach to graph rewriting turns out to be strictly related to Petri nets with read and inhibitor arcs, while the single-pushout approach has strong connections to Petri nets with read and reset arcs.