What do we mean by asynchronous CA? a reflection on types and effects of asynchronicity

Authors:
Stefania Bandini;Andrea Bonomi;Giuseppe Vizzari
Affiliations:
Complex Systems and Artificial Intelligence Research Center, Department of Computer Science, Systems and Communication, University of Milan - Bicocca, Milano, Italy;Complex Systems and Artificial Intelligence Research Center, Department of Computer Science, Systems and Communication, University of Milan - Bicocca, Milano, Italy;Complex Systems and Artificial Intelligence Research Center, Department of Computer Science, Systems and Communication, University of Milan - Bicocca, Milano, Italy
Venue:
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Year:
2010

Citing 6
Cited 2

Local structure theory for cellular automata

Physica D
Computation at the edge of chaos: phase transitions and emergent computation

CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Boolean derivatives on cellular automata

Physica D
Transition phenomena is cellular automata rule space

Physica D
Classifying circular cellular automata

Physica D
Classifying cellular automata automatically: finding gliders, filtering, and relating space-time patterns, attractor basins, and the Z parameter

Complexity

Probing robustness of cellular automata through variations of asynchronous updating

Natural Computing: an international journal
Towards intrinsically universal asynchronous CA

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to introduce the problematics deriving from the adoption of an asynchronous CA model. First of all, several cellular automata update schemes and a tentative classification of such schemes are introduced. In order to study the effects of the different update schemes, we introduced a class of simple CA, called One Neighbor Binary Cellular Automata (1nCA). An overview of the general features of 1nCA is described, then the effects of six different updates schemes on all the class of 1nCA are described.