Abstract
We present a panorama of the convergence properties of the 256 Elementary Cellular Automata under fully asynchronous updating, that is, when only one cell is updated at each time step. We regroup here various results which have been presented in different articles and expose a full analysis of the behaviour of finite systems with periodic boundary conditions. Our classification relies on the scaling properties of the average convergence time to a fixed point. We observe that different scaling laws can be found, which fall in one of the following classes: logarithmic, linear, quadratic, exponential and non-converging. The techniques for quantifying this behaviour rely mainly on Markov chain theory and martingales. Most behaviours can be studied analytically but there are still many rules for which obtaining a formal characterisation of their convergence properties is still an open problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baetens JM, Van der Weeën P, De Baets B (2012) Effect of asynchronous updating on the stability of cellular automata. Chaos Solitons Fractals 45(4):383–394. https://doi.org/10.1016/j.chaos.2012.01.002
Cirillo ENM, Nardi FR, Spitoni C (2018) Basic ideas to approach metastability in probabilistic cellular automata. Springer, Cham, pp 37–51. https://doi.org/10.1007/978-3-319-65558-1_3
Dennunzio A, Formenti E, Manzoni L (2012) Computing issues of asynchronous CA. Fundam Inform 120(2):165–180. https://doi.org/10.3233/FI-2012-755
Deutsch A, Dormann S (2017) Cellular automaton modeling of biological pattern formation characterization, applications, and analysis. modeling and simulation in science, engineering and technology, 2nd edn. Birkhäuser, Basel. https://doi.org/10.1007/978-1-4899-7980-3
Fatès N (2013) A note on the classification of the most simple asynchronous cellular automata. In: Kari J, Kutrib M, Malcher A (eds.) Proceedings of Automata’13, Lecture Notes in Computer Science, vol 8155. Springer, pp 31–45. https://doi.org/10.1007/978-3-642-40867-0_3
Fatès N (2014) A guided tour of asynchronous cellular automata. J Cell Automata 9(5–6):387–416
Fatès N (2014) Quick convergence to a fixed point: A note on asynchronous elementary cellular automata. In: Was J, Sirakoulis GC, Bandini S (eds.) Proceedings of ACRI’14, Lecture Notes in Computer Science, vol 8751. Springer, pp 586–595. https://doi.org/10.1007/978-3-319-11520-7_62
Fatès N (2018) Asynchronous cellular automata. Springer, pp 1–21. https://doi.org/10.1007/978-3-642-27737-5_671-2
Fatès N, Gerin L (2009) Examples of fast and slow convergence of 2D asynchronous cellular systems. J Cell Automata 4(4):323–337
Fatès N, Morvan M, Schabanel N, Thierry E (2006) Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor Comput Sci 362:1–16. https://doi.org/10.1016/j.tcs.2006.05.036
Fatès N, Regnault D, Schabanel N, Thierry E (2006) Asynchronous behavior of double-quiescent elementary cellular automata. In: Correa JR, Hevia A, Kiwi MA (eds) Proceedings of LATIN 2006, Lecture Notes in Computer Science, vol 3887. Springer, pp 455–466. https://doi.org/10.1007/11682462_43
Fatès N, Sethi B, Das S (2018) On the reversibility of ECAs with fully asynchronous updating: The recurrence point of view. In: Adamatzky A (ed) Reversibility and universality, essays presented to Kenichi Morita on the occasion of his 70th birthday. Emergence, complexity and computation, vol 30. Springer, pp 313–332. https://doi.org/10.1007/978-3-319-73216-9
Gerin L (2018) Epidemic automaton and the Eden model: various aspects of robustness. In: Probabilistic cellular automata: theory, applications and future perspectives. Springer, Cham, pp 165–178. https://doi.org/10.1007/978-3-319-65558-1_12
Kari J (2005) Theory of cellular automata: a survey. Theor Comput Sci 334(1–3):3–33. https://doi.org/10.1016/j.tcs.2004.11.021
Kutrib M, Malcher A (2018) Cellular automata: descriptional complexity and decidability. In: Adamatzky A (ed) Reversibility and universality, essays presented to Kenichi Morita on the occasion of his 70th birthday. Emergence, complexity and computation, vol 30. Springer, pp. 129–168. https://doi.org/10.1007/978-3-319-73216-9_6
Regnault D (2013) Proof of a phase transition in probabilistic cellular automata. In: Béal MP, Carton O (eds) Proceedings of developments in language theory. Lecture Notes in Computer Science, vol 7907. Springer, pp 433–444. https://doi.org/10.1007/978-3-642-38771-5
Regnault D, Schabanel N, Thierry E (2009) Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority. Theor Comput Sci 410(47–49):4844–4855. https://doi.org/10.1016/j.tcs.2009.06.024
Rouquier JB, Regnault D, Thierry E (2011) Stochastic minority on graphs. Theor Comput Sci 412(30):3947–3963. https://doi.org/10.1016/j.tcs.2011.02.028
Ruivo EL, de Oliveira PP (2019) A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update. Inf Sci 493:138–151. https://doi.org/10.1016/j.ins.2019.04.045
Schüle M, Stoop R (2012) A full computation-relevant topological dynamics classification of elementary cellular automata. Chaos 22(4):043143. https://doi.org/10.1063/1.4771662
Sethi B, Fatès N, Das S (2014) Reversibility of elementary cellular automata under fully asynchronous update. In: Gopal T, Agrawal M, Li A, Cooper B (eds) Proceedings of TAMC’14, Lecture Notes in Computer Science, vol 8402. Springer, pp 39–49. https://doi.org/10.1007/978-3-319-06089-7_4
Sethi B, Roy S, Das S (2018) Convergence of asynchronous cellular automata: does size matter? J Cell Automata 13(5–6):527–542
Silva F, Correia L (2013) An experimental study of noise and asynchrony in elementary cellular automata with sampling compensation. In: Natural computing, pp 1–16. https://doi.org/10.1007/s11047-013-9387-4
Strömbom D, Hassan T, Hunter Greis W, Antia A (2019) Asynchrony induces polarization in attraction-based models of collective motion. R Soc Open Sci 6(4):190–381. https://doi.org/10.1098/rsos.190381
Taggi L (2018) Convergence time of probabilistic cellular automata on the torus. In: Probabilistic cellular automata: theory, applications and future perspectives. Springer, Cham, pp 179–196. https://doi.org/10.1007/978-3-319-65558-1_13
Worsch T (2012) (Intrinsically?) universal asynchronous CA. In: Sirakoulis GC, Bandini S (eds) Proceedings of ACRI 2012, Lecture Notes in Computer Science. Springer, pp 689–698. https://doi.org/10.1007/978-3-642-33350-7_70
Acknowledgements
Two anonymous reviewers, as well as Irène Marcovici, have devoted their time and patience for reading this manuscript. The author is indebted to them and expresses his gratitude for all the improvements that resulted from their remarks. This article gathers the results gleaned during a long journey and all the persons who helped are also warmly thanked.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Fatès, N. A tutorial on elementary cellular automata with fully asynchronous updating. Nat Comput 19, 179–197 (2020). https://doi.org/10.1007/s11047-020-09782-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-020-09782-7