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

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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11568/97247
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? ND
social impact