Skip to main content

Canonical derivations for high-level replacement systems

  • Conference paper
  • First Online:

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

Abstract

Canonical derivations, previously studied for string and graph grammars only, are generalized from graph grammars to high-level replacement systems, short HLR-systems. These systems were recently introduced to provide a common categorical framework for different types of replacement systems on complex objects, including graphs, hypergraphs, structures and algebraic specifications. It turns out that basic results concerning synthesis and analysis of parallel derivation sequences in HLR-systems, obtained in previous papers, can be extended to construct canonical parallel derivation sequences which are optimal w.r.t. leftmost parallelism. The main results show the existence and uniqueness of canonical derivations under weak assumptions for the underlying categories of HLR-systems. These results are specialized to graphs, hypergraphs, Petri nets, algebraic specifications and others by classifying the underlying categories with respect to the assumptions. This leads to interesting new results for most of the corresponding HLR-systems.

This work is partly supported by the ESPRIT Basic Research Working Group 7183 (COMPUGRAPH).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Corradini, A.; Ehrig, H.; Löwe, M.; Montanari, U.; Rossi, F.: Abstract graph derivations in the double pushout approach, this volume

    Google Scholar 

  2. Diaconescu, R.; Goguen, J.; Stefaneas, P.: Logical Support for Modularisation, in Proc. ADT/COMPASS Workshop 1991, Springer LNCS 655 (1992)

    Google Scholar 

  3. Ehrig, H.; Habel, A.; Kreowski, H.-J.; Parisi-Presicce, F.: Parallelism and Concurrency in High-Level Replacement Systems, Math. Struct. in Comp. Science 1 (1991), 361–404

    Google Scholar 

  4. Ehrig, H.; Habel, A.; Kreowski, H.-J.; Parisi-Presicce, F.: From Graph Grammars to High-Level Replacement Systems, Proc. 4th Int. Workshop on Graph Grammars and Their Applications to Computer Science, Springer LNCS 532 (1991), 269–291

    Google Scholar 

  5. Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars (A Survey) in: Graph Grammars and Their Application to Computer Science and Biology, Springer LNCS 73, (1979), 1–69

    Google Scholar 

  6. Ehrig, H.; Kreowski, H.-J.: Pushout Properties: An Analysis of Gluing Constructions for Graphs, Math. Nachrichten 91 (1979), 135–149

    Google Scholar 

  7. Ehrig, H.; Kreowski, H.-J.; Taentzer, G.: Canonical Derivations for High-level Replacement Systems, Computer Science Report no.6/92, University of Bremen, 1992

    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), 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. H. Ehrig, F. Parisi-Presicce: Algebraic Specification Grammars: A Junction Between Module Specifications and Graph Grammars, Proc. 4th Int. Workshop on Graph Grammars and Application to Computer Science, Springer LNCS 532(1991), 292–310

    Google Scholar 

  11. H. Ehrig, F. Parisi-Presicce: Nonequivalence of Categories for Equational Algebraic Specifications in View of High-Level-Replacement Systems, Techn. Report No 91-16, TU Berlin, FB 20, 1991

    Google Scholar 

  12. Ehrig, H.; Parisi-Presicce, F.: Interaction between Algebraic Specification Grammars and Modular System Design, Proc. AMAST'93

    Google Scholar 

  13. Kreowski, H.-J.: Kanonische Ableitungssequenzen für Graphgrammatiken, Techn. Report No. 76-26, TU Berlin, FB 20, 1976

    Google Scholar 

  14. Kreowski, H.-J.: Manipulation von Graph Transmanipulationen, PhD Thesis, TU Berlin, 1977

    Google Scholar 

  15. Maibaum, T.; Sadler, M.: Axiomatizing Specification Theory, Proc. 3rd ADT-Workshop, Bremen, 1984, Informatik-Fachberichte 116 (1985), 171–177

    Google Scholar 

  16. Maibaum, T.S.E.; Veloso, P.A.S.; Sadler, M.R.: A Theory of Abstract Data Types for Program Development: Bridging the Gap? Proc. TAPSOFT'85, Vol 2, Springer LNCS 186 (1985), 214–230

    Google Scholar 

  17. Parisi-Presicce, F.: Foundations of Rule-Based Design of Modular Systems, TCS 83, No. 1 (1991)

    Google Scholar 

  18. Padberg, J.; Ehrig, H.; Ribeiro, L.: Algebraic High-Level Net Transformation Systems, Techn. Report No. 93-12, TU Berlin, FB 20, 1993

    Google Scholar 

  19. Ribeiro, L.; Ehrig, H.; Padberg, J.: Formal Development of Concurrent Systems using Algebraic High-Level Nets and Transformations, Techn. Report No. 93-13, TU Berlin, FB 20, 1993, and Proc. SE-Conf. Brazil, 1993

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans Jürgen Schneider Hartmut Ehrig

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ehrig, H., Kreowski, H.J., Taentzer, G. (1994). Canonical derivations for high-level replacement systems. In: Schneider, H.J., Ehrig, H. (eds) Graph Transformations in Computer Science. Lecture Notes in Computer Science, vol 776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57787-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-57787-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48333-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics