Multilevel graph grammars

  • Francesco Parisi-Presicce
  • Gabriele Piersanti
Conference paper

DOI: 10.1007/3-540-59071-4_37

Part of the Lecture Notes in Computer Science book series (LNCS, volume 903)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Francesco Parisi-Presicce
    • 1
  • Gabriele Piersanti
    • 2
  1. 1.Dipartimento di Scienze dell'InformazioneUniversita' di Roma ‘La Sapienza’RomaItaly
  2. 2.Dipartimento di Matematica Pura ed ApplicataUniversitá degli Studi de L'AquilaL'AquilaItaly

Personalised recommendations