Skip to main content

Self-description for Construction and Execution in Graph Rewriting Automata

  • Conference paper
Advances in Artificial Life (ECAL 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3630))

Included in the following conference series:

Abstract

In this paper, we consider how self-description can be realized for construction and execution in a single framework of a variant of graph rewriting systems, called graph rewriting automata. As an example of self-description for construction, self-replication based on a self-description is shown. A meta-node structure is introduced for self-description for execution that enables us to embed rule sets in the graph structure. It can be a model of systems that maintain and modify themselves.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bedian, V.: Self-Description and the Origin of the Genetic Code. Biosystems 60, 39–47 (2001)

    Article  Google Scholar 

  2. Benko, G., Flamm, C., Stadler, P.F.: Genetic Properties of Chemical Networks: Artificial Chemistry Based on Graph Rewriting. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds.) ECAL 2003. LNCS (LNAI), vol. 2801, pp. 10–19. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Google Scholar 

  4. Klavins, E.: Universal Self-Replication Using Graph Grammars. In: Proc. 2004 Intl. Conf. on MEMS, NANO and Smart Systems (ICMENS 2004), pp. 198–204 (2004)

    Google Scholar 

  5. Klavins, E., Ghrist, R., Lipsky, D.: Graph Grammars for Self Assembling Robotic Systems. In: Proc. 2004 IEEE Intl. Conf. on Robotics and Automation (ICRA 2004), pp. 5293–5300 (2004)

    Google Scholar 

  6. McMullin, B., von Neumann, J.: The Evolutionary Growth of Complexity: Looking Backward, Looking Forward. Artificial Life 6(4), 347–361 (2000)

    Article  Google Scholar 

  7. Saidani, S.: Self-Reconfigurable Robots Topodynamic. In: Proc. 2004 IEEE Intl. Conf. on Robotics and Automation (ICRA 2004), pp. 2883–2887 (2004)

    Google Scholar 

  8. Salzberg, C., Sayama, H., Ikegami, T.: A Tangled Hierarchy of Graph-Constructing Graphs. In: Artificial Life IX: Proc. Ninth Intl. Conf. on the Simulation and Synthesis of Living Systems, pp. 495–500 (2004)

    Google Scholar 

  9. Sipper, M.: Fifty Years of Research on Self-Replication: An Overview. Artificial Life 4(3), 237–257 (1998)

    Article  Google Scholar 

  10. Sipper, M., Reggia, J.A.: Go Forth and Replicate. Scientific American 285(2), 26–35 (2001)

    Article  Google Scholar 

  11. Smith, B.C.: Reflection and Semantics in Lisp. In: Proc. 11th ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages, pp. 23–35 (1984)

    Google Scholar 

  12. Tomita, K., Kurokawa, H., Murata, S.: Graph Automata: Natural Expression of Self-Reproduction. Physica D 171(4), 197–210 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. von Neumann, J.: The Theory of Self-Reproducing Automata. Univ. of Illinois Press, US (1966)

    Google Scholar 

  14. Watson, J.D., Crick, F.H.C.: A Structure for Deoxyribose Nucleic Acid. Nature 171, 737–738 (1953)

    Article  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

Tomita, K., Murata, S., Kamimura, A., Kurokawa, H. (2005). Self-description for Construction and Execution in Graph Rewriting Automata. In: Capcarrère, M.S., Freitas, A.A., Bentley, P.J., Johnson, C.G., Timmis, J. (eds) Advances in Artificial Life. ECAL 2005. Lecture Notes in Computer Science(), vol 3630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553090_71

Download citation

  • DOI: https://doi.org/10.1007/11553090_71

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31816-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics