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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Paolo, E.A.D.: Searching for rhythms in asynchronous random boolean networks. In: Bedau, M. (ed.) Alife VII: Proc. of the 7th International Conference, pp. 73–80. MIT Press, Cambridge (2000)
Thomas, R., European Molecular Biology Organization: Kinetic Logic: a Boolean Approach to the Analysis of Complex Regulatory Systems. Lecture notes in Biomathematics, vol. 29. Springer, Berlin (1979)
Kanada, Y.: The effects of randomness in asynchronous 1d cellular automata (poster). Artificial Life IV (1994)
Cornforth, D., Green, D.G., Newth, D.: Ordered asynchronous processes in multi-agent systems. Physica D: Nonlinear Phenomena 204(1-2), 70–82 (2005)
Li, W., Packard, N., Langton, C.G.: Transition phenomena in CA rule space. Physica D 45, 77 (1990)
Wolfram, S.: Cellular automata. Los Alamos Science 9, 2–21 (Fall 1983)
Gutowitz, H., Victor, J.D., Knight, B.W.: Local structure theory for cellular automata. Physica D 28, 18–48 (1987)
Li, W., Packard, N.: The structure of the elementary cellular automata rule space. Complex Systems 4(3), 281–297 (1990)
Sutner, K.: Classifying circular CA. Physica D 45, 386 (1990)
Wuensche, A.: Classifying cellular automata automatically: Finding gliders, filtering, and relating space-time patterns, attractor basins, and the Z parameter. Complexity 4(3), 47–66 (1999)
Wolfram, S.: Statistical mechanics of cellular automata. Reviews of Modern Physics 55, 601–644 (1983)
Langton, C.G.: Computation at the edge of chaos. Physica D 42, 12–37 (1990)
Mitchell, M., Hraber, P.T., Crutchfield, J.P.: Revisiting the edge of chaos: Evolving cellular automata to perform computations. Complex Systems 7, 89–130 (1993)
Binder, P.: Parametric ordering of complex systems. Physical Review E 49(3), 2023–2025 (1994)
Binder, P.: A phase diagram for elementary cellular automata. Complex Systems 7, 241–247 (1993)
Vichniac, G.Y.: Boolean derivatives on cellular automata. Physica D 45(1-3), 63–74 (1990)
Fatès, N.: Experimental study of elementary cellular automata dynamics using the density parameter. In: Discrete Models for Complex Systems, DMCS 2003. DMTCS Proceedings, Discrete Mathematics and Theoretical Computer Science, vol. AB, pp. 155–166 (2003)
Fatès, N., Morvan, M.: An experimental study of robustness to asynchronism for elementary cellular automata. Complex Systems 16(1), 1–27 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bandini, S., Bonomi, A., Vizzari, G. (2010). What Do We Mean by Asynchronous CA? A Reflection on Types and Effects of Asynchronicity. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds) Cellular Automata. ACRI 2010. Lecture Notes in Computer Science, vol 6350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15979-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-15979-4_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15978-7
Online ISBN: 978-3-642-15979-4
eBook Packages: Computer ScienceComputer Science (R0)