Multilevel graph grammars
- Cite this paper as:
- Parisi-Presicce F., Piersanti G. (1995) Multilevel graph grammars. In: Mayr E.W., Schmidt G., Tinhofer G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg
The classical double pushout approach to the algebraic theory of graph grammars is extended to multilevel graph representations, where parts of graphs are not visible and the information can be restored via the explicit application of productions. The notions of applicability and derivation are investigated and the compatibility of the representations with the derivations is shown. Production mechanisms for multilevel graph are motivated by problems in Visual Languages and the representation of Iconic Languages in particular.
Unable to display preview. Download preview PDF.