Multilevel graph grammars

  • Francesco Parisi-Presicce
  • Gabriele Piersanti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 903)

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.

References

  1. 1.
    Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars. Springer Lect. Notes Comp. Sci. 73 (1979) 1–69Google Scholar
  2. 2.
    Ehrig, H., Habel, A., Kreowski, H.J., Parisi-Presicce, F.: From Graph Grammars to High Level Replacement Systems. Springer Lect. Notes Comp. Sci. 532 (1991) 269–287Google Scholar
  3. 3.
    Golin, E.J., Reiss, S.P.: The Specification of Visual Language Syntax. Proc. IEEE Workshop on Visual Languages, Rome (Italy) (1989) 105–110Google Scholar
  4. 4.
    Hesse, W.: Two level graph grammars. Springer Lect. Notes Comp. Sci. 73 (1979) 255–269Google Scholar
  5. 5.
    Helm, R., Marriot, K.: Declarative Specification of Visual Languages. Proc. IEEE Workshop on Visual Languages, Skokie (Illinois, USA) (1990) 98–103Google Scholar
  6. 6.
    Kennaway, J.R.: On On graph rewriting. Theoret. Comp. Sci. 52 (1987) 37–58Google Scholar
  7. 7.
    Löwe, M.: Extended Algebraic Graph Transformation. Technical Report, Technische Universitat Berlin feb 1991, 180 pagesGoogle Scholar
  8. 8.
    Nagl, M.: A tutorial and bibliographical survey on Graph Grammars. Springer Lect. Notes Comp. Sci. 73 (1979) 70–126Google Scholar
  9. 9.
    Ollongren, A.: On multilevel graph grammars. Springer Lect. Notes Comp. Sci. 73 (1979) 341–349Google Scholar
  10. 10.
    Parisi-Presicce, F.: Single vs. Double pushout derivations of Graph. Springer Lect. Notes Comp. Sci. 657 (1993) 248–262Google Scholar
  11. 11.
    Parisi-Presicce, F., Ehrig, H., Montanari, U.: Graph Rewriting with unification and composition. Springer Lect. Notes Comp. Sci. 291 (1987) 496–514Google Scholar
  12. 12.
    Parisi-Presicce, F., Piersanti, G.: Multilevel Graph Grammars. Techn. Rep. 93/33, Dip. Matematica Pura ed Applicata, Universita' di L'Aquila, (1993)Google Scholar
  13. 13.
    Parisi-Presicce, F., Piersanti, G.: Graph Based Modelling of Visual Languages. in preparationGoogle Scholar
  14. 14.
    Pratt, T.W.: Pair grammars, Graph Languages and string to graph transformations. J. Comput. System Sci. 5 (1971) 560–595Google Scholar
  15. 15.
    Raoult, J.C.: On graph rewriting. Theoret. Comp. Sci. 32 (1984) 1–24Google Scholar

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