Asynchronous graph-rewriting automata and simulation of synchronous execution

Kohji Tomita, Satoshi Murata, Haruhisa Kurokawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationAdvances in Artificial Life - 9th European Conference, ECAL 2007, Proceedings
Number of pages11
Publication statusPublished - 2007 Dec 1
Externally publishedYes
Event9th European Conference on Advance in Artificial Life, ECAL 2007 - Lisbon, Portugal
Duration: 2007 Sep 102007 Sep 14

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4648 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other9th European Conference on Advance in Artificial Life, ECAL 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Asynchronous graph-rewriting automata and simulation of synchronous execution'. Together they form a unique fingerprint.

Cite this