Skip to main content
SpringerLink
Log in

More About Control Conditions for Transformation Units

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

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

Abstract

A transformation unit is a structuring principle for composing graph transformation systems from small units. One of the basic components of a transformation unit is its control condition which allows to restrict the non-determinism of graph transformation. The concept of transformation units is generic in the sense that each formalism which specifies a binary relation on graphs can be used as a control condition. This paper discusses a selection of concrete classes of control conditions which seem to provide reasonable expressive power for specifying and programming with transformation units. These include regular expressions, once, as-long-as-possible, priorities, and conditionals; some of them were already used in an ad hoc manner in earlier papers. It is shown which classes of control conditions can be replaced by others without changing the semantics of the corresponding transformation unit. Moreover, three properties of control conditions are studied: minimality, invertibility and continuity.

This work was partially supported by the ESPRIT WorkingGrou p 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. 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. Bunke, H.: Programmed graph grammars. In: Claus, V., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol. 73, pp. 155–166. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  3. 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 [Roz97]

    Google Scholar 

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

    Google Scholar 

  5. Dassow, J., Pǎun, G. (eds.): Regulated Rewriting in Formal Language Theory. EATCS Monographs on Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)

    Google Scholar 

  6. Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Applications, Languages and Tools. World Scientific, Singapore (1999) (to appear)

    Google Scholar 

  7. Ehrig, H., Habel, A.: Graph grammars with application conditions. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 87–100. Springer, Heidelberg (1986)

    Google Scholar 

  8. 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 [Roz97], pp. 247–312

    Google Scholar 

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

    Google Scholar 

  10. Heckel, R., Engels, G., Ehrig, H., Taentzer, G.: Classification and comparison of modul concepts for graph transformation systems. In: Ehrig et al. [EEKR99] (to appear)

    Google Scholar 

  11. Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae XXVI(3,4), 287–313 (1996)

    MathSciNet  Google Scholar 

  12. Kreowski, H.-J., Kuske, S.: On the interleavingsem antics 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 

  13. Kreowski, H.-J., Kuske, S.: Graph transformation units and modules. In: Ehrig et al. [EEKR99] (to appear)

    Google Scholar 

  14. 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 

  15. Litovsky, I., Métivier, Y.: Computing with graph rewriting systems with priorities. Theoretical Computer Science 115, 191–224 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. Maggiolo-Schettini, A., Winkowski, J.: A kernel language for programmed rewriting of (hyper)graphs. Acta Informatica 33(6), 523–546 (1996)

    Article  MathSciNet  Google Scholar 

  17. Nagl, M.: Graph-Grammatiken: Theorie, Anwendungen, Implementierungen. Vieweg, Braunschweig (1979)

    Google Scholar 

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

    Google Scholar 

  19. Schneider, H.-J.: Syntax-directed description of incremental compilers. In: Siefkes, D. (ed.) GI — 4. Jahrestagung. LNCS, vol. 26, pp. 192–201 (1975)

    Google Scholar 

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

    Google Scholar 

  21. Taentzer, G., Ermel, C., Rudolf, M.: The AGG-approach: Language and tool environment. In: Ehrig et al. [EEKR99] (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 3, Universität Bremen, Postfach 33 04 40, D-28334, Bremen, Germany

    Sabine Kuske

Authors
  1. 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

Kuske, S. (2000). More About Control Conditions for Transformation Units. 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_23

Download citation

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

  • 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