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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bedian, V.: Self-Description and the Origin of the Genetic Code. Biosystems 60, 39–47 (2001)
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)
Rozenberg, R. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific, Singapore (1997)
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)
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)
McMullin, B., von Neumann, J.: The Evolutionary Growth of Complexity: Looking Backward, Looking Forward. Artificial Life 6(4), 347–361 (2000)
Saidani, S.: Self-Reconfigurable Robots Topodynamic. In: Proc. 2004 IEEE Intl. Conf. on Robotics and Automation (ICRA 2004), pp. 2883–2887 (2004)
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)
Sipper, M.: Fifty Years of Research on Self-Replication: An Overview. Artificial Life 4(3), 237–257 (1998)
Sipper, M., Reggia, J.A.: Go Forth and Replicate. Scientific American 285(2), 26–35 (2001)
Smith, B.C.: Reflection and Semantics in Lisp. In: Proc. 11th ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages, pp. 23–35 (1984)
Tomita, K., Kurokawa, H., Murata, S.: Graph Automata: Natural Expression of Self-Reproduction. Physica D 171(4), 197–210 (2002)
von Neumann, J.: The Theory of Self-Reproducing Automata. Univ. of Illinois Press, US (1966)
Watson, J.D., Crick, F.H.C.: A Structure for Deoxyribose Nucleic Acid. Nature 171, 737–738 (1953)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)