Asynchronous graph-rewriting automata and simulation of synchronous execution

Kohji Tomita, Satoshi Murata, Haruhisa Kurokawa

研究成果: Conference contribution

5 被引用数 (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.

本文言語English
ホスト出版物のタイトルAdvances in Artificial Life - 9th European Conference, ECAL 2007, Proceedings
ページ865-875
ページ数11
出版ステータスPublished - 2007 12月 1
外部発表はい
イベント9th European Conference on Advance in Artificial Life, ECAL 2007 - Lisbon, Portugal
継続期間: 2007 9月 102007 9月 14

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4648 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other9th European Conference on Advance in Artificial Life, ECAL 2007
国/地域Portugal
CityLisbon
Period07/9/1007/9/14

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Asynchronous graph-rewriting automata and simulation of synchronous execution」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル