Abstract
We introduce an extension of Graph Grammars (GGs), called Dynamic Graph Grammars (DynGGs), where the right-hand side of a production can spawn fresh parts of the type graph and fresh productions operating on it. The features of DynGGs make them suitable for the straightforward modeling of reflexive mobile systems like dynamic nets and the Join calculus. Our main result shows that each DynGG can be modeled as a (finite) GG, so that the dynamically generated structure can be typed statically, still preserving exactly all derivations. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Bruni, R., & Melgratti, H. (2006). Dynamic graph transformation systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4178 LNCS, pp. 230–244). Springer Verlag. https://doi.org/10.1007/11841883_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
