Skip to main content
Springer Nature Link
Log in

Typing of Graph Transformation Units

  • Conference paper
Graph Transformations (ICGT 2004)

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

Included in the following conference series:

  • 885 Accesses

Abstract

The concept of graph transformation units in its original sense is a structuring principle for graph transformation systems which allows the interleaving of rule applications with calls of imported units in a controlled way. The semantics of a graph transformation unit is a binary relation on an underlying type of graphs. In order to get a flexible typing mechanism for transformation units and a high degree of parallelism this paper introduces typed graph transformation units that transform k-tuples of typed input graphs into l-tuples of typed output graphs in a controlled and structured way. The transformation of the typed graph tuples is performed with actions that apply graph transformation rules and imported typed units simultaneously to the graphs of a tuple. The transformation process is controlled with control conditions and with graph tuple class expressions. The new concept of typed graph transformation units is illustrated with examples from the area of string parsing with finite automata.

Research partially supported by the EC Research Training Network SegraVis (Syntactic and Semantic Integration of Visual Modeling Techniques) and the Collaborative Research Centre 637 (Autonomous Cooperating Logistic Processes: A Paradigm Shift and Its Limitations) funded by the German Research Foundation (DFG).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 42.79
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 52.74
Price includes VAT (France)
  • 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.

Similar content being viewed by others

References

  1. 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), 1–54 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Corradini, A., Ehrig, H., Heckel, R., Löwe, M., Montanari, U., Rossi, F.: Algebraic approaches to graph transformation part I: Basic concepts and double pushout approach. In: Rozenberg [15], pp. 163–245

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  4. Drewes, F., Habel, A., Kreowski, H.-J.: Hyperedge replacement graph grammars. In: Rozenberg [15], pp. 95–162

    Google Scholar 

  5. Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Applications, Languages and Tools, vol. 2. World Scientific, Singapore (1999)

    Google Scholar 

  6. Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation II: Single pushout approach and comparison with double pushout approach. In: Rozenberg [15], pp. 247–312

    Google Scholar 

  7. Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallelism, and Distribution, vol. 3. World Scientific, Singapore (1999)

    Google Scholar 

  8. Engelfriet, J., Rozenberg, G.: Node replacement graph grammars. In: Rozenberg [15], pp. 1–94

    Google Scholar 

  9. Klempien-Hinrichs, R., Kreowski, H.-J., Kuske, S.: Rule-based transformation of graphs and the product type. In: van Bommel, P., (ed.) Handbook on Transformation of Knowledge, Information, and Data (to appear)

    Google Scholar 

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

    Chapter  Google Scholar 

  11. Kreowski, H.-J., Kuske, S.: Graph transformation units and modules. In: Ehrig, Engels, Kreowski, and Rozenberg [5], pp. 607–638

    Google Scholar 

  12. Kreowski, H.-J., Kuske, S.: Graph transformation units with interleaving semantics. Formal Aspects of Computing 11(6), 690–723 (1999)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  14. Pratt, T.W.: Pair grammars, graph languages and string-to-graph translations. Journal of Computer and System Sciences 5, 560–595 (1971)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  16. Schürr, A.: Specification of graph translators with triple graph grammars. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 151–163. Springer, Heidelberg (1995)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Renate Klempien-Hinrichs, Hans-Jörg Kreowski & Sabine Kuske

Authors
  1. Renate Klempien-Hinrichs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. 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. George Mason University, Fairfax, Virginia, USA

    Francesco Parisi-Presicce

  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

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klempien-Hinrichs, R., Kreowski, HJ., Kuske, S. (2004). Typing of Graph Transformation Units. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds) Graph Transformations. ICGT 2004. Lecture Notes in Computer Science, vol 3256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30203-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30203-2_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23207-0

  • Online ISBN: 978-3-540-30203-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation