Back to Search
Start Over
Unfolding semantics of graph transformation
- Source :
-
Information & Computation . May2007, Vol. 205 Issue 5, p733-782. 50p. - Publication Year :
- 2007
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
- Subjects :
- *GRAPH theory
*GRAMMAR
*SEMANTICS
*MATHEMATICAL analysis
Subjects
Details
- Language :
- English
- ISSN :
- 08905401
- Volume :
- 205
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Information & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 24609453
- Full Text :
- https://doi.org/10.1016/j.ic.2006.11.004