×

What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity. (English) Zbl 1306.68103

Bandini, Stefania (ed.) et al., Cellular automata. 9th international conference on cellular automata for research and industry, ACRI 2010, Ascoli Piceno, Italy, September 21–24, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15978-7/pbk). Lecture Notes in Computer Science 6350, 385-394 (2010).
Summary: 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.
For the entire collection see [Zbl 1196.68001].

MSC:

68Q80 Cellular automata (computational aspects)
Full Text: DOI

References:

[1] 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)
[2] 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) · doi:10.1007/978-3-642-49321-8
[3] Kanada, Y.: The effects of randomness in asynchronous 1d cellular automata (poster). Artificial Life IV (1994)
[4] Cornforth, D., Green, D.G., Newth, D.: Ordered asynchronous processes in multi-agent systems. Physica D: Nonlinear Phenomena 204(1-2), 70–82 (2005) · doi:10.1016/j.physd.2005.04.005
[5] Li, W., Packard, N., Langton, C.G.: Transition phenomena in CA rule space. Physica D 45, 77 (1990) · Zbl 0729.68060 · doi:10.1016/0167-2789(90)90175-O
[6] Wolfram, S.: Cellular automata. Los Alamos Science 9, 2–21 (Fall 1983)
[7] Gutowitz, H., Victor, J.D., Knight, B.W.: Local structure theory for cellular automata. Physica D 28, 18–48 (1987) · Zbl 0634.92022 · doi:10.1016/0167-2789(87)90120-5
[8] Li, W., Packard, N.: The structure of the elementary cellular automata rule space. Complex Systems 4(3), 281–297 (1990) · Zbl 0724.68071
[9] Sutner, K.: Classifying circular CA. Physica D 45, 386 (1990) · Zbl 0729.68065 · doi:10.1016/0167-2789(90)90196-V
[10] 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) · doi:10.1002/(SICI)1099-0526(199901/02)4:3<47::AID-CPLX9>3.0.CO;2-V
[11] Wolfram, S.: Statistical mechanics of cellular automata. Reviews of Modern Physics 55, 601–644 (1983) · Zbl 1174.82319 · doi:10.1103/RevModPhys.55.601
[12] Langton, C.G.: Computation at the edge of chaos. Physica D 42, 12–37 (1990) · doi:10.1016/0167-2789(90)90064-V
[13] 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) · Zbl 0834.68086
[14] Binder, P.: Parametric ordering of complex systems. Physical Review E 49(3), 2023–2025 (1994) · doi:10.1103/PhysRevE.49.2023
[15] Binder, P.: A phase diagram for elementary cellular automata. Complex Systems 7, 241–247 (1993)
[16] Vichniac, G.Y.: Boolean derivatives on cellular automata. Physica D 45(1-3), 63–74 (1990) · Zbl 0715.68065 · doi:10.1016/0167-2789(90)90174-N
[17] 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) · Zbl 1073.68687
[18] Fatès, N., Morvan, M.: An experimental study of robustness to asynchronism for elementary cellular automata. Complex Systems 16(1), 1–27 (2005) · Zbl 1167.37307
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.