Advertisement

Single vs. double pushout derivations of graphs

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

Abstract

Graph grammars in which the generation of graphs using productions and restricting derivation sequences based on the double pushout, recently introduced by H.Ehrig and the author and motivated by modular software design, are shown to have strictly more expressive power than those using derivations based on the single pushout approach of [12]. Furthermore, not being based on the internal structure of graphs, the approach can be immediately generalized to other formalisms, such as algebraic specifications, jungles, etc.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    P.Boehm, H.R.Fonio, A.Habel: Amalgamation of Graph Transformations: a synchronization mechanism. J. Comput. Syst. Sci 34 (1987) 377–408Google Scholar
  2. 2.
    H.Ehrig: Introduction to the Algebraic Theory of Graph Grammars. First International Workshop on Graph Grammars, Springer Lecture Notes in Computer Science 73 (1979) 1–69Google Scholar
  3. 3.
    H.Ehrig, A.Habel,H.-J.Kreowski,F.Parisi-Presicce: Parallelism and Concurrency in High Level Replacement Systems. Math. Struct.in Comp. Science 1 (1991) 361–406Google Scholar
  4. 4.
    H.Ehrig, H.-J.Kreowski, G.Rozenberg (eds): Graph Grammars and their applications to Computer Science. Springer Lecture Notes in Computer Science 532 (1991)Google Scholar
  5. 5.
    H.Ehrig, M.Nagl, G.Rozenberg (eds): Graph Grammars and their applications to Computer Science. Springer Lecture Notes in Computer Science 153 (1983)Google Scholar
  6. 6.
    H.Ehrig, M.Nagl, G.Rozenberg, A.Rosenfeld (eds): Graph Grammars and their applications to Computer Science. Springer Lecture Notes in Computer Science 291 (1987)Google Scholar
  7. 7.
    H.Ehrig, F.Parisi-Presicce: Interactions between Graph Grammars and Modular System Design. Technical ReportGoogle Scholar
  8. 8.
    H.Ehrig, M.Pfender, H.J.Schneider: Graph Grammars: an algebraic approach. Proc. IEEE Conf. SWAT 73, Iowa City (1973) 167–180Google Scholar
  9. 9.
    J.R.Kennaway: On On Graph Rewriting. Theoret. Comp. Sci 52 (1987) 37–58Google Scholar
  10. 10.
    J.R.Kennaway: Graph rewriting in some categories of partial morphisms. in [4].Google Scholar
  11. 11.
    H.-J.Kreowski, A.Wilharm: Is Parallelism already Concurrency? Part 2: Non sequential Processes in Graph Grammars. in [6].Google Scholar
  12. 12.
    M.Lowe: Extended Algebraic Graph Transformation. Doctoral Dissertation, Technische Universität Berlin Feb 1991, 180 pagesGoogle Scholar
  13. 13.
    M.Lowe, H.Ehrig: Algebraic Approach to Graph Transformation Based on Single pushout Derivations. Proc. 16th Workshop Graph Theoretic Concepts in Comp. Sci., Springer Lecture Notes in Computer Science 484 (1990) 338–353Google Scholar
  14. 14.
    F.Parisi-Presicce: Modular System Design applying Graph Grammar Techniques. Proc. ICALP 89, Springer Lecture Notes in Computer Science 372 (1989) 621–636Google Scholar
  15. 15.
    F.Parisi-Presicce: A Rule Based Approach to Modular System Design. Proc. 12th Internat. Conf. Soft. Engin. (1990) 202–211Google Scholar
  16. 16.
    F.Parisi-Presicce: Foundations of Rule-Based Design of Modular Systems. Theoret. Comp. Sci. 83 (1991) 131–155Google Scholar
  17. 17.
    F.Parisi-Presicce, H.Ehrig, U.Montanari: Graph rewriting with Unification and Composition. in [6].Google Scholar
  18. 18.
    J.C.Raoult: On Graph Rewriting. Theoret. Comp. Sci. 32 (1984) 1–24Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Francesco Parisi-Presicce
    • 1
  1. 1.Dipartimento di Matematica Pura ed ApplicataUniversitá degli Studi L'AquilaL'AquilaItaly

Personalised recommendations