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.
Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs
CORRADINI, ANDREA;MONTANARI, UGO GIOVANNI ERASMO
2005-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
