Several attempts have been made of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets, 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 (semi-weighted) graph grammars and the category of prime algebraic domains, which factorises through the category of occurrence grammars and the category of asymmetric event structures. For general, possibly nonsemi-weighted single-pushout grammars, we define an analogous functorial concurrent semantics, which, however, is not characterised as an adjunction. Similar results can be obtained for double-pushout graph grammars, under the assumptions that nodes are never deleted.
|Autori:||BALDAN P; CORRADINI A; MONTANARI; RIBEIRO L|
|Titolo:||Unfolding Semantics of Graph Transformation|
|Anno del prodotto:||2007|
|Digital Object Identifier (DOI):||10.1016/j.ic.2006.11.004|
|Appare nelle tipologie:||1.1 Articolo in rivista|