Advertisement

Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system

  • Gabriele Taentzer
  • Martin Beyer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 776)

Abstract

The Agg-system is a prototype implementation of the algebraic approach to graph transformation. It consists of a flexible graph editor and a transformation component. The editor allows the graphical representation of production rules, occurrences and transformation results. The transformation component performs direct transformation steps for user-selected production rules and occurrences.

First steps towards a graph specification of an abstract version of the Agg-system are possible by using amalgamated graph transformations. Agg-states are modelled by graphs whereas Agg-operations are described by amalgamated graph transformations combining parallel and sequential rewriting of graphs.

Keywords

graph grammar system algebraic graph grammars parallel graph transformation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BCF91]
    D. A. Bailey, J. E. Cuny, and C. D. Fisher, Programming with very large graphs, In Ehrig et al. [EKR91].Google Scholar
  2. [Bet92]
    R. Betschko, Parallele Graphgrammatiken mit Synchronisation, Studienarbeit, Technical University of Berlin, Dep. of Comp. Sci., 1992.Google Scholar
  3. [Bey91]
    M. Beyer, GAG: Ein graphischer Editor für algebraische Graphgrammatiksysteme, Diplomarbeit, Technical University of Berlin, Dep. of Comp. Sci., 1991.Google Scholar
  4. [Bey92]
    M. Beyer, AGG1.0 — Tutorial, Technical University of Berlin, Department of Computer Science, 1992.Google Scholar
  5. [BFH87]
    P. Böhm, H.-R. Fonio, and A. Habel, Amalgamation of graph transformations: a synchronization mechanism, J. of Comp. and Syst. Sci. 34 (1987), 377–408.Google Scholar
  6. [Bra91]
    F. Brandenburg, Layout Graph Grammars: The Placement Approach, In Ehrig et al. [EKR91], pp. 144–156.Google Scholar
  7. [DDK93]
    G. David, F. Drewes, and H.-J. Kreowski, Hyperedge Replacement with Rendezvous, 1993, to appear in proc. of 12th conf. of FST and TCS'92.Google Scholar
  8. [EHKP92]
    H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce, Parallelism and concurrency in High Level Replacement Systems, Math. Struct. in Comp. Sci. 1 (1992), 361–404.Google Scholar
  9. [Ehr79]
    H. Ehrig, Introduction to the algebraic theory of graph grammars, 1st Int. Workshop on Graph Grammars and their Application to Computer Science and Biology, LNCS 73, Springer, 1979, pp. 1–69.Google Scholar
  10. [EK76]
    H. Ehrig and H.-J. Kreowski, Parallel Graph Grammars, Automata,Languages, Development (A. Lindenmayer and G. Rozenberg, eds.), Amsterdam: North Holland, 1976, pp. 425–447.Google Scholar
  11. [EKR91]
    H. Ehrig, H.-J. Kreowski, and G. Rozenberg (eds.), 4th Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 532, Springer, 1991.Google Scholar
  12. [ET92]
    H. Ehrig and G. Taentzer, From Parallel Graph Grammars to Parallel High-Level Replacement Systems, Lindenmayer Systems, Springer, 1992, pp. 283–303.Google Scholar
  13. [Göt87a]
    H. Göttler, Graph grammars and diagram editing, 3rd Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 291, Springer, 1987, pp. 216–231.Google Scholar
  14. [Göt87b]
    H. Göttler (ed.), Graphgrammatiken in Softwareengineering, Universität Erlangen, 1987.Google Scholar
  15. [Him91]
    M. Himsolt, GraphEd: An interactive tool for developing graph grammars, In Ehrig et al. [EKR91], pp. 61–65.Google Scholar
  16. [JRV82]
    D. Janssens, G. Rozenberg, and R. Verraedt, On sequential and parallel noderewriting graph grammars, Computer Vision, Graphics and Image Processing 18 (1982), 279–304.Google Scholar
  17. [Kre92]
    H.-J. Kreowski, Parallel Hyperedge Replacement, Lindenmayer Systems, Springer, 1992, pp. 271–282.Google Scholar
  18. [LB93]
    M. Löwe and M. Beyer, AGG — An Implementation of Algebraic Graph Rewriting, LNCS 690, Springer, 1993, Rewriting Techniques and Applications, Fifth Int. Conf., RTA'93.Google Scholar
  19. [Löw93]
    M. Löwe, Algebraic approach to single-pushout graph transformation, Theoretical Computer Science 109 (1993), 181–224.Google Scholar
  20. [NA83]
    A. Nakamura and K. Aizawa, On a relationship between graph L-systems and picture languages, Theoretical Computer Science 24 (1983), 161–177.Google Scholar
  21. [Nag87]
    M. Nagl, A software development environment based on graph technology, 3rd Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 291, Springer, 1987, pp. 458–478.Google Scholar
  22. [NP91]
    F. Newbery Paulisch, The Design of an Extendible Graph Editor, Ph.D. thesis, University of Karlsruhe, Department of Informatics, March 1991.Google Scholar
  23. [RS86]
    G. Rozenberg and A. Salomaa, The Book of L, Springer, Berlin, 1986.Google Scholar
  24. [RS92]
    G. Rozenberg and A. Salomaa, Lindenmayer Systems, Springer, 1992.Google Scholar
  25. [Sch91]
    A. Schürr, Operationales Spezifizieren mit programmierten Graphersetzungssystemen, Deutscher Universitätsverlag GmbH, Wiesbaden, 1991.Google Scholar
  26. [Tae92]
    G. Taentzer, Parallel High-Level Replacement Systems, Tech. Report 92/10, Technical University of Berlin, Dep. of Comp. Sci., 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Gabriele Taentzer
    • 1
  • Martin Beyer
    • 1
  1. 1.Computer Science DepartmentTechnical University of BerlinBerlin

Personalised recommendations