Relating SPO and DPO graph rewriting
with Petri nets having read, inhibitor and reset arcs
Paolo Baldan(1) -
Andrea Corradini(2) -
Ugo Montanari(2)
(1)Dipartimento di Informatica, Università Ca' Foscari di Venezia, Italia.
(2)Dipartimento di Informatica, Università di Pisa, Italia.
Abstract:
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.