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. Research supported by the FET-GC Project IST-2001-32747 Agile and by the MIUR Project COFIN 2001013518 CoMeta.
|Titolo:||Coreflective Concurrent Semantics for Single-Pushout Graph Grammars|
|Autori interni:||BALDAN, Paolo|
|Data di pubblicazione:||2002|
|Serie:||LECTURE NOTES IN COMPUTER SCIENCE|
|Appare nelle tipologie:||3.1 Articolo su libro|