Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

From graph grammars to high level replacement systems

  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 532))

Abstract

The algebraic approach to graph grammars — well-known in the literature for several types of graphs and structures — is extended to include several new types of replacement systems, especially the replacement of algebraic specifications which were recently introduced for a rule-based approach to modular system design.

This leads to the new concept of high level replacement systems which is formulated in an axiomatic algebraic framework based on categories and double-pushouts. In this paper only basic notions like productions, derivations, parallel and sequential independence are introduced for high-level replacement systems leading to Church-Rosser and Parallelism Theorems previously shown in the literature for special cases only.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. Arbib, M.A.; Manes, E.G.: Arrows, Structures and Functors, Academic Press, New York-San Francisco-London, 1975

    Google Scholar 

  2. Corradini, U. Montanari, F. Rossi, H. Ehrig, M. Löwe: Graph Grammars and Logic Programming, in [EKR 91]

    Google Scholar 

  3. Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars, LNCS 73 (1979), p. 1–69

    Google Scholar 

  4. Ehrig, H.; Habel, A.; Rosen, B.K.: Concurrent Transformations of Relational Structures, Fundamenta Informaticae IX (1986), 13–50

    Google Scholar 

  5. Ehrig, H.; Habel, A.; Kreowski, H.-J.; Parisi-Presicce, F.: Parallelism and Concurrency in High Level Replacement Systems, Techn. Report, TU Berlin, FB 20, No. 90/35

    Google Scholar 

  6. Ehrig, H.; Kreowski, H.-J.: Categorical Theory of Graph Grammars, Techn. Report TU Berlin, FB 20, Bericht Nr. 75-08 (1975)

    Google Scholar 

  7. Ehrig, H.; Kreowski, H.-J.; Rozenberg, G.: Graph Grammars and Their Applications to Computer Science, to appear in LNCS 1991

    Google Scholar 

  8. Ehrig, H.; Kreowski, H.-J.; Maggiolo-Schettini, A.; Rosen, B.; Winkowski, J.: Transformation of Structures: An Algebraic Approach, Math. Syst. Theory 14 (1981), p. 305–334

    Article  Google Scholar 

  9. Ehrig, H.; Mahr, B.: Fundamentals of Algebraic Specification 1. Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, Vol. 6, Springer (1985)

    Google Scholar 

  10. Ehrig, H.; Rosen, B.K.: Parallelism and Concurrency of Graph Manipulations. Theor. Comp. Sci. 11 (1980), 247–275

    Article  Google Scholar 

  11. Ehrig, H.; Pfender, M.; Schneider, H.J.: Graph Grammars: An Algebraic Approach, Proc. IEEE Conf. SWAT'73, Iowa City (1973), p. 167–180

    Google Scholar 

  12. Habel, A.: Hyperedge Replacement: Grammars and Languages; Ph.D. Thesis, Univ. Bremen, 1989

    Google Scholar 

  13. Hummert, U.: Algebraische Theorie von High-Level-Netzen, Ph.D.Thesis, TU Berlin, 1989

    Google Scholar 

  14. Herrlich, H.; Stecker, G.E.: Category Theory. Allyn and Bacon, Boston 1973

    Google Scholar 

  15. Kreowski, H.-J.: Manipulation von Graphmanipulationen, Ph.D. Thesis, TU Berlin, 1977

    Google Scholar 

  16. MacLane, S.: Categories for the working mathematician. Springer New York-Heidelberg-Berlin 1972

    Google Scholar 

  17. Meseguer, P.; Montanari, U.;: Petri Nets are Monoids: A New Algebraic Foundation for Neth Theory; Proc. Logics in Comp. Sci., 1988

    Google Scholar 

  18. Parisi-Presicce, F.; Ehrig, H.: Algebraic Specification Grammars, in [EKR 91]

    Google Scholar 

  19. Parisi-Presicce, F.; Ehrig, H.; Montanari, U.; Graph Rewriting with Unification and Composition, Proc. 3rd Int. Workshop on Graph Grammars, Springer LNCS 291 (1987), p. 496–511

    Google Scholar 

  20. Parisi-Presicce, F.: Modular System Design Applying Graph Grammar Techniques, Proc. 16th ICALP, Springer LNCS 372 (1989), p. 621–636

    Google Scholar 

  21. Parisi-Presicce, F.: A Rule Based Approach to Modular System Design, Proc. 12th Inf. Conf. Software Engineering, March 1990

    Google Scholar 

  22. Schneider, H. J.; Ehrig, H.: Grammars on Partial Graphs, Acta Informatica 6 (1976), p. 297–316

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical University Berlin, Franklinstraße 28/29, W-1000, Berlin 10, Germany

    Hartmut Ehrig

  2. University of Bremen, Postfach 33 04 40, W-2800, Bremen 33, Germany

    Annegret Habel & Hans-Jörg Kreowski

  3. Università degli Studi Aquila, Via Vetoio, 1-67100, L'Aquila, Italia

    Francesco Parisi-Presicce

Authors
  1. Hartmut Ehrig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Annegret Habel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Francesco Parisi-Presicce
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ehrig, H., Habel, A., Kreowski, HJ., Parisi-Presicce, F. (1991). From graph grammars to high level replacement systems. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017395

Download citation

  • DOI: https://doi.org/10.1007/BFb0017395

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54478-4

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation