EnglishIt 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.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/11568/97247| Titolo: | Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs |
| Autori interni: | CORRADINI, ANDREA MONTANARI, UGO GIOVANNI ERASMO |
| Anno del prodotto: | 2005 |
| Rivista: | ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE |
| 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. |
| Handle: | http://hdl.handle.net/11568/97247 |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
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.
Copyright © 2017