TY - GEN
T1 - Asynchronous graph-rewriting automata and simulation of synchronous execution
AU - Tomita, Kohji
AU - Murata, Satoshi
AU - Kurokawa, Haruhisa
PY - 2007
Y1 - 2007
N2 - In this paper, we consider asynchronous update scheme for a variant of graph rewriting systems called graph-rewriting automata, and show that synchronous update can be simulated by asynchronous update using a constructed rule set from the one for synchronous update. It is well known that such rule construction is possible on cellular automata or other automata networks whose structures are fixed, but graph rewriting automata induce structural changes and additional mechanism of communication and local synchronization is required. Some simple examples are given by simulation.
AB - In this paper, we consider asynchronous update scheme for a variant of graph rewriting systems called graph-rewriting automata, and show that synchronous update can be simulated by asynchronous update using a constructed rule set from the one for synchronous update. It is well known that such rule construction is possible on cellular automata or other automata networks whose structures are fixed, but graph rewriting automata induce structural changes and additional mechanism of communication and local synchronization is required. Some simple examples are given by simulation.
UR - http://www.scopus.com/inward/record.url?scp=38049080649&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38049080649&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-74913-4_87
DO - 10.1007/978-3-540-74913-4_87
M3 - Conference contribution
AN - SCOPUS:38049080649
SN - 9783540749127
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 865
EP - 875
BT - Advances in Artificial Life - 9th European Conference, ECAL 2007, Proceedings
PB - Springer Verlag
T2 - 9th European Conference on Advance in Artificial Life, ECAL 2007
Y2 - 10 September 2007 through 14 September 2007
ER -