The problem of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets has been faced several times along the years, both for the single-pushout and double-pushout approaches, but only partial results were obtained. In this paper we fully extend Winskel’s approach to single-pushout grammars providing them with a categorical concurrent semantics expressed as a coreflection between the category of graph grammars and the category of prime algebraic domains.
Coreflective Concurrent Semantics for Single-Pushout Graph Grammars
CORRADINI, ANDREA;MONTANARI, UGO GIOVANNI ERASMO;
2003-01-01
Abstract
The problem of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets has been faced several times along the years, both for the single-pushout and double-pushout approaches, but only partial results were obtained. In this paper we fully extend Winskel’s approach to single-pushout grammars providing them with a categorical concurrent semantics expressed as a coreflection between the category of graph grammars and the category of prime algebraic domains.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.
