Probing robustness of cellular automata through variations of asynchronous updating

Typically viewed as a deterministic model of spatial computing, cellular automata are here considered as a collective system subject to the noise inherent to natural computing. The classical updating scheme is replaced by stochastic versions which either randomly update cells or disrupt the cell-to-cell transmission of information. We then use the novel updating schemes to probe the behaviour of elementary cellular automata, and observe a wide variety of results. We study these behaviours in the scope of macroscopic statistical phenomena and microscopic analysis. Finally, we discuss the possibility to use updating schemes to probe the robustness of complex systems.

[1]  H. Blok,et al.  Synchronous versus asynchronous updating in the ''game of Life'' , 1999 .

[2]  Fabien Michel,et al.  MIC: A Deployment Environment for Autonomous Agents , 2004, E4MAS.

[3]  Nazim Fatès.  Does Life Resist Asynchrony? , 2010, Game of Life Cellular Automata.

[4]  Stefania Bandini,et al.  Modeling and Programming Asynchronous Automata Networks: The MOCA Approach , 2010, ACRI.

[5]  Stefania Bandini,et al.  What Do We Mean by Asynchronous CA? A Reflection on Types and Effects of Asynchronicity , 2010, ACRI.

[6]  Damien Regnault,et al.  Directed Percolation Arising in Stochastic Cellular Automata Analysis , 2008, MFCS.

[7]  Nazim Fatès,et al.  First steps on asynchronous lattice-gas models with an application to a swarming rule , 2013, Natural Computing.

[8]  Nazim Fatès,et al.  Robustness of Cellular Automata in the Light of Asynchronous Information Transmission , 2011, UC.

[9]  Henryk Fuks,et al.  Orbits of the Bernoulli measure in single-transition asynchronous cellular automata , 2011, Automata.

[10]  H. Hinrichsen.  Non-equilibrium critical phenomena and phase transitions into absorbing states , 2000, cond-mat/0001070.

[11]  Luís Correia,et al.  Effects of asynchronism on evolutionary games. , 2011, Journal of theoretical biology.

[12]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[13]  Nazim Fatès,et al.  An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata , 2004, Complex Syst..

[14]  David H. Ackley,et al.  Homeostatic Architectures for Robust Spatial Computing , 2011, 2011 Fifth IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshops.

[15]  Nobuyuki Matsui,et al.  Self-Timed Cellular Automata and their computational ability , 2002, Future Gener. Comput. Syst..

[16]  Nazim Fatès,et al.  Observation of novel patterns in a stressed lattice-gas model of swarming , 2011 .

[17]  T. E. Ingerson,et al.  Structure in asynchronous cellular automata , 1984 .

[18]  N. Macrae.  John Von Neumann , 1992 .

[19]  Nazim Fatès,et al.  Asynchronism Induces Second-Order Phase Transitions in Elementary Cellular Automata , 2007, J. Cell. Autom..

[20]  Karel Culik,et al.  Undecidability of CA Classification Schemes , 1988, Complex Syst..