We introduce a framework called graph-rewriting automata to model evolution processes of networks. It is a natural extension of cellular automata in the sense that a fixed lattice space of cellular automata is extended to a dynamic graph structure by introducing local graph-rewriting rules. We consider three different constructions of rule sets to show that various network evolution is possible: hand-coding, evolutionary generation, and exhaustive search. Graph-rewriting automata provide a new tool to describe various complex systems and to approach many scientific problems.
Adaptive Networks: Theory, Models and Applications
year
2009
chapter
14
pages
291--309
publisher
Springer
series
Understanding Complex Systems
file
Tomita2009 - Graph-rewriting automata as a natural extension of cellular automata.pdf:Self-Organization and Self-Assembly/Tomita2009 - Graph-rewriting automata as a natural extension of cellular automata.pdf:PDF
%0 Book Section
%1 Tomita2009
%A Tomita, Kohji
%A Kurokawa, Haruhisa
%A Murata, Satoshi
%B Adaptive Networks: Theory, Models and Applications
%C Berlin/Heidelberg
%D 2009
%E Gross, Thilo
%E Sayama, Hiroki
%I Springer
%K reference
%P 291--309
%R 10.1007/978-3-642-01284-6_14
%T Graph-Rewriting Automata as a Natural Extension of Cellular Automata
%X We introduce a framework called graph-rewriting automata to model evolution processes of networks. It is a natural extension of cellular automata in the sense that a fixed lattice space of cellular automata is extended to a dynamic graph structure by introducing local graph-rewriting rules. We consider three different constructions of rule sets to show that various network evolution is possible: hand-coding, evolutionary generation, and exhaustive search. Graph-rewriting automata provide a new tool to describe various complex systems and to approach many scientific problems.
%& 14
@incollection{Tomita2009,
abstract = {We introduce a framework called graph-rewriting automata to model evolution processes of networks. It is a natural extension of cellular automata in the sense that a fixed lattice space of cellular automata is extended to a dynamic graph structure by introducing local graph-rewriting rules. We consider three different constructions of rule sets to show that various network evolution is possible: hand-coding, evolutionary generation, and exhaustive search. Graph-rewriting automata provide a new tool to describe various complex systems and to approach many scientific problems.},
added-at = {2021-02-07T21:50:11.000+0100},
address = {Berlin/Heidelberg},
author = {Tomita, Kohji and Kurokawa, Haruhisa and Murata, Satoshi},
biburl = {https://www.bibsonomy.org/bibtex/265a3ab8ad03b3f4b82926a57dc750959/huazai},
booktitle = {Adaptive Networks: Theory, Models and Applications},
chapter = 14,
doi = {10.1007/978-3-642-01284-6_14},
editor = {Gross, Thilo and Sayama, Hiroki},
file = {Tomita2009 - Graph-rewriting automata as a natural extension of cellular automata.pdf:Self-Organization and Self-Assembly/Tomita2009 - Graph-rewriting automata as a natural extension of cellular automata.pdf:PDF},
interhash = {9e627b6eb3736fbf8128081524796f2f},
intrahash = {65a3ab8ad03b3f4b82926a57dc750959},
keywords = {reference},
pages = {291--309},
publisher = {Springer},
series = {Understanding Complex Systems},
timestamp = {2021-02-08T08:50:59.000+0100},
title = {Graph-Rewriting Automata as a Natural Extension of Cellular Automata},
year = 2009
}