Skip to main content

Relational Growth Grammars – A Graph Rewriting Approach to Dynamical Systems with a Dynamical Structure

  • Conference paper
Unconventional Programming Paradigms (UPP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3566))

Included in the following conference series:

Abstract

Relational growth grammars (RGG) area graph rewriting formalism which extends the notations and semantics of Lindenmayer systems and which allows the specification of dynamical processes on dynamical structures, parti cular ly in biological and chemical applications. RGG were embedded in the language XL, combining rule-based and conventional object-oriented con structions. Key features of RGG and of the software GroIMP (Growth grammar related Interactive Modelling Platform) are listed. Five simple examples are shown which demonstrate the essential ideas and possibilities of RGG: signal propagation in a network, cellular automata, globally-sensitive growth of a plant, a “chemical” prime number generator, and a polymerisation model using a simple mass-spring kinetics.

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

Access this chapter

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. Banâtre, J.-P., Fradet, P., Radenac, Y.: Chemical specification of autonomic systems. In: Proceedings of the 13th International Conference on Intelligent and Adaptive Systems and Software Engineering (IASSE 2004) (July 2004), http://www.irisa.fr/paris/Biblio/Papers/Banatre/BanFraRad04IASSE.pdf

  2. Buck-Sorlin, G.H., Kniemeyer, O., Kurth, W.: Barley morphology, genetics and hormonal regulation of internode elongation modelled by a Relational Growth Grammar. New Phytologist 166 (2005) (in press)

    Google Scholar 

  3. Ehrig, H., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation—part II: Single pushout approach and comparison with double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. 1, pp. 247–312. World Scientific, Singapore (1997)

    Chapter  Google Scholar 

  4. Ermel, C., Rudolf, M., Taentzer, G.: The AGG-approach: Language and tool environment. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Applications, Languages and Tools, vol. 2, pp. 551–604. World Scientific, Singapore (1999)

    Google Scholar 

  5. Floyd, R.: The paradigms of programming. Communications of the ACM 22, 455–460 (1979)

    Article  Google Scholar 

  6. Gardner, M.: Wheels, Life, and Other Mathematical Amusements. W.H. Freeman, New York (1983)

    MATH  Google Scholar 

  7. Giavitto, J.-L., Michel, O.: MGS: A rule-based programming language for complex objects and collections. Electronic Notes in Theoretical Computer Science 59(4) (2001)

    Google Scholar 

  8. Göttler, H.: Graph grammars, a new paradigm for implementing visual languages. In: Dershowitz, N. (ed.) Rewriting Techniques and Applications, pp. 152–166. Springer, Berlin (1989)

    Google Scholar 

  9. Herzog, R.: Ausbau eines bereits implementierten Graphtransformationstools zu einem Plug¬in für Cinema 4D. Bachelor Thesis, BTU Cottbus (2004)

    Google Scholar 

  10. Kniemeyer, O.: Rule-based modelling with the XL/GroIMP software. In: Schaub, H., Detje, F., Brüggemann, U. (eds.) The Logic of Artificial Life. Proceedings of 6th GWAL, Bamberg, Germany, April 14–16, 2004, pp. 56–65. AKA, Berlin (2004)

    Google Scholar 

  11. Kniemeyer, O., Buck-Sorlin, G., Kurth, W.: A graph grammar approach to Artificial Life. Artificial Life 10(4), 413–431 (2004)

    Article  Google Scholar 

  12. Kurth, W.: Some new formalisms for modelling the interactions between plant architecture, competition and carbon allocation. Bayreuther Forum Ökologie 52, 53–98 (1998)

    Google Scholar 

  13. Nagl, M.: A tutorial and bibliographical survey on graph-grammars. In: Claus, V., Ehrig, H., Rozenberg, G. (eds.) Graph-Grammars and Their Application to Computer Science and Biology, pp. 70–126. Springer, Berlin (1979)

    Chapter  Google Scholar 

  14. Prusinkiewicz, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer, New York (1990)

    MATH  Google Scholar 

  15. Prusinkiewicz, P.: Art and science for life: Designing and growing virtual plants with L-systems. In: Davidson, C., Fernandez, T. (eds.) Nursery Crops: Development, Evaluation, Production and Use: Proceedings of the XXVI International Horticultural Congress. Acta Horticulturae, vol. 630, pp. 15–28 (2004)

    Google Scholar 

  16. Rozenberg, G.: T0L systems and languages. Information and Control 23, 357–381 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  17. Schürr, A.: Programmed graph replacement systems. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. 1, pp. 479–546. World Scientific, Singapore (1997)

    Chapter  Google Scholar 

  18. Schürr, A., Winter, A.J., Zündorf, A.: The PROGRES approach: Language and environ¬ment. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Applications, Languages and Tools, vol. 2, pp. 487–550. World Scientific, Singapore (1999)

    Google Scholar 

  19. Skusa, A., Banzhaf, W., Busch, J., Dittrich, P., Ziegler, J.: Künstliche Chemie. Künstliche Intelligenz 1, 12–19 (2000)

    Google Scholar 

  20. Wolfram, S.: Cellular Automata and Complexity. Collected papers. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurth, W., Kniemeyer, O., Buck-Sorlin, G. (2005). Relational Growth Grammars – A Graph Rewriting Approach to Dynamical Systems with a Dynamical Structure. In: Banâtre, JP., Fradet, P., Giavitto, JL., Michel, O. (eds) Unconventional Programming Paradigms. UPP 2004. Lecture Notes in Computer Science, vol 3566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527800_5

Download citation

  • DOI: https://doi.org/10.1007/11527800_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27884-9

  • Online ISBN: 978-3-540-31482-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics