Advertisement

Natural Computing

, Volume 11, Issue 4, pp 553–564 | Cite as

Probing robustness of cellular automata through variations of asynchronous updating

  • Olivier BouréEmail author
  • Nazim Fatès
  • Vincent Chevrier
Article

Abstract

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.

Keywords

Asynchronous cellular automata Robustness Discrete dynamical systems Phase transitions Directed percolation 

References

  1. Ackley DH, Williams LR (2011) Homeostatic architecture for robust spatial computing. In: Proceedings of the 5th IEEE international conference on self-adaptive and self-organizing systemsGoogle Scholar
  2. Bandini S, Bonomi A, Vizzari G (2010) What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity. In: Proceedings of ACRI 2010. Lecture notes in computer science, vol 6350, pp 385–394Google Scholar
  3. Bandini S, Bonomi A, Vizzari G (2010) Modeling and programming asynchronous automata networks: the MOCA approach. In: Proceedings of ACRI 2010. Lecture notes in computer science, vol 6350, pp 345–355Google Scholar
  4. Blok HJ, Bergersen B (1999) Synchronous versus asynchronous updating in the "Game of Life”. Phys Rev E 590(4):3876–3879CrossRefGoogle Scholar
  5. Bouré O, Fatès N, Chevrier V (2011) Robustness of cellular automata in the light of asynchronous information transmission. In Unconventional Computation, volume 6714 of Lecture Notes in Computer Science, pp 52–63Google Scholar
  6. Bouré O, Fatès N, Chevrier V (2012) First steps on asynchronous lattice-gas models with an application to a swarming rule. In: Proceedings of ACRI 2012. Lecture notes in computer science. http://hal.inria.fr/hal-00687987/ (to appear)
  7. Culik K II, Yu S (1988) Undecidability of CA classification schemes. Complex Syst 2:177–190MathSciNetzbMATHGoogle Scholar
  8. Fatès N (2009) Asynchronism induces second order phase transitions in elementary cellular automata. J Cell Autom 40(1):21–38Google Scholar
  9. Fatès N (2010) Does Life resist asynchrony? In: Game of life cellular automata. Springer, London, pp 257–274Google Scholar
  10. Fatès N, Morvan M (2005) An experimental study of robustness to asynchronism for elementary cellular automata. Complex Syst 16:1–27Google Scholar
  11. Fukś H, Skelton A (2012) Orbits of bernoulli measure in asynchronous cellular automata. DMTCS, AP:0, pp 95–112. In: Proceedings of automata 2011.Google Scholar
  12. Gouaïch A, Michel F, Guiraud Y (2005) MIC*: a deployment environment for autonomous agents. In: Post-proceedings of the 1st international workshop in environments for multiagent systems. Springer, London, , pp 109–126Google Scholar
  13. Grilo C, Correia L (2011) Effects of asynchronism on evolutionary games. J Theor Biol 2690(1):109–122CrossRefGoogle Scholar
  14. Hinrichsen H (2000) Nonequilibrium critical phenomena and phase transitions into absorbing states. Adv Phys 49:815–958CrossRefGoogle Scholar
  15. Ingerson TE, Buvel RL (1984) Structure in asynchronous cellular automata. Physica D 100(1–2):59–68MathSciNetCrossRefGoogle Scholar
  16. Peper F, Isokawa T, Takada Y, Matsui N (2002) Self-timed cellular automata and their computational ability. Futur Gener Comput Syst 180(7):893–904CrossRefGoogle Scholar
  17. Regnault D (2008) Directed percolation arising in stochastic cellular automata analysis. In: Mathematical foundations of computer science. Lecture notes in computer science, vol 5162. Springer, London, pp 563–574Google Scholar
  18. von Neumann J (1966) Theory of self-reproducing automata. University of Illinois Press, ChampaignGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  • Olivier Bouré
    • 1
    Email author
  • Nazim Fatès
    • 1
  • Vincent Chevrier
    • 1
  1. 1.Université de Lorraine—INRIA Nancy Grand-Est—LORIANancyFrance

Personalised recommendations