Asynchronous graph-rewriting automata and simulation of synchronous execution

Authors:
Kohji Tomita;Satoshi Murata;Haruhisa Kurokawa
Affiliations:
National Institute of Advanced Industrial Science and Technology, Tsukuba, Japan;Tokyo Institute of Technology, Yokohama, Japan;National Institute of Advanced Industrial Science and Technology, Tsukuba, Japan
Venue:
ECAL'07 Proceedings of the 9th European conference on Advances in artificial life
Year:
2007

Citing 5
Cited 2

Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
A new kind of science

A new kind of science
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
From Machine and Tape to Structure and Function: Formulation of a Reflexively Computing System

Artificial Life
Self-description for construction and execution in graph rewriting automata

ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life

Causal graph dynamics

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Causal graph dynamics

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.