Probing robustness of cellular automata through variations of asynchronous updating

Authors:
Olivier Bouré;Nazim Fatès;Vincent Chevrier
Affiliations:
Université de Lorraine--INRIA Nancy Grand-Est--LORIA, Nancy, France;Université de Lorraine--INRIA Nancy Grand-Est--LORIA, Nancy, France;Université de Lorraine--INRIA Nancy Grand-Est--LORIA, Nancy, France
Venue:
Natural Computing: an international journal
Year:
2012

Citing 9
Cited 3

Undecidability of CA classification schemes

Complex Systems
Self-timed cellular automata and their computational ability

Future Generation Computer Systems - Cellular automata CA 2000 and ACRI 2000
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
Directed Percolation Arising in Stochastic Cellular Automata Analysis

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Modeling and programming asynchronous automata networks: the MOCA approach

ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
What do we mean by asynchronous CA? a reflection on types and effects of asynchronicity

ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Robustness of cellular automata in the light of asynchronous information transmission

UC'11 Proceedings of the 10th international conference on Unconventional computation
Homeostatic Architectures for Robust Spatial Computing

SASOW '11 Proceedings of the 2011 Fifth IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshops
MIC*: a deployment environment for autonomous agents

E4MAS'04 Proceedings of the First international conference on Environments for Multi-Agent Systems

First steps on asynchronous lattice-gas models with an application to a swarming rule

Natural Computing: an international journal
An experimental study of noise and asynchrony in elementary cellular automata with sampling compensation

Natural Computing: an international journal
Towards intrinsically universal asynchronous CA

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

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.