Skip to main content
SpringerLink
Log in

Simple Modules for Grace

  • Conference paper
Theory and Application of Graph Transformations (TAGT 1998)

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

Abstract

The language Grace is being proposed for specifying and programming in a graph-centered environment based on graph transformation. Emphasis in the design of Grace is laid on modular structuring of programs. In this paper we present a simple kind of modules for the language which encapsulate rules and graph transformation units, and export some of them. The local transformation units define compound graph transformations that call rules and other transformation units which are either defined by the surrounding module, or imported from other modules. The interleaving semantics of modules specifies a binary relation on graphs for each exported item.

This work was partially supported by the ESPRIT Working Group Applications of Graph Transformation (APPLIGRAPH) and the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The Programming Language Ada. ISO standard 8652 (1995), See also at http://lglwww.epfl.ch/Ada/

  2. Andries, M., Engels, G., Habel, A., Hoffmann, B., Kreowski, H.-J., Kuske, S., Plump, D., Schürr, A., Taentzer, G.: Graph transformation for specification and programming. Science of Computer Programming 34, 1–54 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arnold, K., Gosling, J.: The Java Programming Language, 2nd edn. Addison Wesley’s Java Series (1998)

    Google Scholar 

  4. Christofides, N.: Graph Theory: An Algorithmic Approach. Academic Press, Inc., London (1975)

    MATH  Google Scholar 

  5. Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26(3,4), 241–266 (1996)

    MATH  MathSciNet  Google Scholar 

  6. Ehrig, H., Engels, G.: Pragmatic and semantic aspects of a module concept for graph transformation systems. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 137–154. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  7. Große-Rhode, M., Parisi-Presicce, F., Simeoni, M.: Spatial and temporal refinement of typed graph transformation systems. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 553–561. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae XXVII(1/2) (1996)

    Google Scholar 

  9. Heckel, R., Ehrig, H., Engels, G., Taentzer, G.: Classification and comparison of module concepts for graph transformation systems. In: Engels, G., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation. Specification and Programming, vol. II (1999) (to appear)

    Google Scholar 

  10. Hoffmann, B.: From graph transformation to rule-based programming with diagrams. In: Nagl, M., Schürr, A. (eds.) Proc. Int’l Workshop and Symposium on Applications of Graph Transformation with Industrial Relevance (AGTIVE), to appear in Lecture Notes in Computer Science (1999)

    Google Scholar 

  11. Kreowski, H.-J., Kuske, S.: On the interleaving semantics of transformation units — a step into GRACE. In: Cuny, J.E., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 89–108. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  12. Kreowski, H.-J., Kuske, S., Schürr, A.: Nested graph transformation units. International Journal on Software Engineering and Knowledge Engineering 7(4), 479–502 (1998)

    Article  Google Scholar 

  13. Kuske, S.: More about control conditions for transformation units. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 150–157. Springer, Heidelberg (1998)

    Google Scholar 

  14. Peterson, J., Hammond, K., Augustsson, L., Boutel, B., Burton, W., Fasel, J., Gordon, A.D., Hughes, J., Hudak, P., Johnsson, T., Jones, M., Meijer, E., Jones, S.P., Reid, A., Wadler, P.: Report on the Programming Language Haskell, Version 1.4. Yale University (April 1997), See http://www.haskell.org/report/index.html

  15. Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. I. World Scientific, Singapore (1997)

    Google Scholar 

  16. Schürr, A.: PROGRES: A VHL-language based on graph grammars. In: Schneider, H.-J., Ehrig, H. (eds.) Proc. Graph Transformations in Computer Science. LNCS, vol. 776, pp. 641–659 (1994)

    Google Scholar 

  17. Schürr, A.: Programmed graph replacement systems. In: Rozenberg [Roz97], pp. 479–546

    Google Scholar 

  18. Taentzer, G., Beyer, M.: Amalgamated graph transformation systems and their use for specifying AGG – an algebraic graph grammar system. In: Schneider, H.-J., Ehrig, H. (eds.) Dagstuhl Seminar 1993. LNCS, vol. 776, pp. 380–394. Springer, Heidelberg (1994)

    Google Scholar 

  19. Taentzer, G., Schürr, A.: DIEGO, another step towards a module concept for graph transformation systems. In: Proc. of SEGRAGRA 1995. Graph Rewriting and Computation, Electronic Notes of TCS, vol. 2 (1995), http://www.elsevier.nl/locate/entcs/volume2.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 17 Informatik, Universität-GH Paderborn, Warburger Str. 100, D-33098, Paderborn, Germany

    Reiko Heckel

  2. Fachbereich 3 Mathematik – Informatik, Universität Bremen, Postfach 33 04 40, D-28334, Bremen, Germany

    Berthold Hoffmann, Peter Knirsch & Sabine Kuske

Authors
  1. Reiko Heckel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Berthold Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Knirsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sabine Kuske
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Hartmut Ehrig

  2. University of Paderborn, Warburger Straße 100, 33098, Paderborn, Germany

    Gregor Engels

  3. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heckel, R., Hoffmann, B., Knirsch, P., Kuske, S. (2000). Simple Modules for Grace . In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Theory and Application of Graph Transformations. TAGT 1998. Lecture Notes in Computer Science, vol 1764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46464-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46464-8_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67203-6

  • Online ISBN: 978-3-540-46464-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation