An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata

Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect synchronicity. However, these two assumptions have little chance to truthfully represent what happens at the microscopic scale for physical, biological or social systems.One may thus wonder whether CA do keep their behavior when submitted to small perturbations of synchronicity.This work focuses on the study of one-dimensional (1D) asynchronous CA with two states and nearest-neighbors. We define what we mean by ``the behavior of CA is robust to asynchronism'' using a statistical approach with macroscopic parameters.and we present an experimental protocol aimed at finding which are the robust 1D elementary CA. To conclude, we examine how the results exposed can be used as a guideline for the research of suitable models according to robustness criteria.

[1]  Nazim Fat.  Experimental study of Elementary Cellular Automata dynamics using the density parameter , 2003 .

[2]  Gianpiero Cattaneo,et al.  Generalized Sub-Shifts in Elementary Cellular Automata: The "Strange Case" of Chaotic Rule 180 , 1998, Theor. Comput. Sci..

[3]  B A Huberman,et al.  Evolutionary games and computer simulations. , 1993, Proceedings of the National Academy of Sciences of the United States of America.

[4]  P. Hogeweg,et al.  Modelling Morphogenesis: From Single Cells to Crawling Slugs. , 1997, Journal of theoretical biology.

[5]  Jacques M. Bahi,et al.  Stability of fully asynchronous discrete-time discrete-state dynamic networks , 2002, IEEE Trans. Neural Networks.

[6]  P. Grassberger.  SYNCHRONIZATION OF COUPLED SYSTEMS WITH SPATIOTEMPORAL CHAOS , 1999 .

[7]  Alexis Drogoul,et al.  Modelling urban phenomena with cellular automata , 2000, Adv. Complex Syst..

[8]  Stephen Wolfram,et al.  Universality and complexity in cellular automata , 1983 .

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

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

[11]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[12]  W. R. Stark,et al.  Asynchronous, irregular automata nets: the path not taken. , 2000, Bio Systems.

[13]  A. Odlyzko,et al.  Algebraic properties of cellular automata , 1984 .

[14]  Nazim Fatès.  Robustesse de la dynamique des systèmes discrets : le cas de l'asynchronisme dans les automates cellulaires , 2004 .

[15]  Mike Mannion,et al.  Complex systems , 1997, Proceedings International Conference and Workshop on Engineering of Computer-Based Systems.

[16]  M. Nowak,et al.  Evolutionary games and spatial chaos , 1992, Nature.

[17]  Rodney A. Brooks,et al.  Asynchrony induces stability in cellular automata based models , 1994 .

[18]  B. Schönfisch,et al.  Synchronous and asynchronous updating in cellular automata. , 1999, Bio Systems.

[19]  Y. Pomeau.  Front motion, metastability and subcritical bifurcations in hydrodynamics , 1986 .

[20]  Hugues Chaté,et al.  Spatio-temporal intermittency in coupled map lattices , 1988 .

[21]  Nazim Fatès,et al.  Experimental study of Elementary Cellular Automata dynamics using the density parameter , 2003, DMCS.

[22]  P. Kurka.  Languages, equicontinuity and attractors in cellular automata , 1997, Ergodic Theory and Dynamical Systems.

[23]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[24]  Paul Manneville,et al.  Criticality in cellular automata , 1990 .

[25]  Enrico Formenti,et al.  On undecidability of equicontinuity classification for cellular automata , 2003, DMCS.