Abstract
We prove that the limit dynamics of any finite automata network under the parallel update schedule correspond exactly to the fixed points of a so-called strictly one-way cellular automaton. This correspondence is proven to be exact, as any strictly one-way cellular automaton can be transformed into a corresponding automata network, the limit dynamics of the latter corresponding exactly to the fixed points of the former. This transformation is operated using output functions, which have been developed in the author’s previous works.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alekseyevskaya T, Malenkov A (1991) Mathematical model of the initiation of near weekly fluctuations in tissue (cellular automata). Biophysics 36(2):356–360
Bhattacharjee K, Naskar N, Roy S, Das S (2020) A survey of cellular automata: types, dynamics, non-uniformity and applications. Nat Comput 19:433–461
Chopard B, Droz M (2005) Cellular automata modeling of physical systems. Cambridge University Press, Cambridge
Davidich MI, Bornholdt S (2008) Boolean network model predicts cell cycle sequence of fission yeast. PLoS ONE 3:1672
Demongeot J, Goles E, Morvan M, Noual M, Sené S (2010) Attraction basins as gauges of robustness against boundary conditions in biological complex systems. PLoS ONE 5:11793
Demongeot J, Noual M, Sené S (2012) Combinatorics of Boolean automata circuits dynamics. Discr Appl Math 160:398–415
Fuentes M, Kuperman M (1999) Cellular automata and epidemiological models with spatial dependence. Physica A 267(3–4):471–486
Gao Z, Chen X, Başar T (2018) Stability structures of conjunctive Boolean networks. Automatica 89:8–20
Kari J (2005) Theory of cellular automata: a survey. Theoret Comput Sci 334(1–3):3–33
Kauffman SA (1969) Metabolic stability and epigenesis in randomly constructed genetic nets. J Theor Biol 22:437–467
Kutrib M (2014) Complexity of one-way cellular automata. In: International workshop on cellular automata and discrete complex systems. Springer, pp 3–18
Mendoza L, Alvarez-Buylla ER (1998) Dynamics of the genetic regulatory network for Arabidopsis thaliana flower morphogenesis. J Theor Biol 193:307–319
Nagel K, Schreckenberg M (1992) A cellular automaton model for freeway traffic. J Phys I 2(12):2221–2229
Noual M (2012) Updating automata networks. PhD thesis, École Normale Supérieure de Lyon
Perrot K, Perrotin P, Sené S (2018) A framework for (de)composing with Boolean automata networks. In: Proc of MCU’18. LNCS, vol 10881, pp 121–136
Perrot K, Perrotin P, Sené S (2020) On the complexity of acyclic modules in automata networks. In: Proc of TAMC’20. Springer, pp 168–180
Perrot K, Perrotin P, Sené S (2021) Optimising attractor computation in Boolean automata networks. Springer, pp 68–80
Sarkar P (2000) A brief history of cellular automata. ACM Comput Surv (CSUR) 32(1):80–107
Thomas R (1973) Boolean formalization of genetic control circuits. J Theor Biol 42:563–585
Acknowledgements
This work has been partially funded by ANR-18-CE40-0002 FANs project and ECOS-Sud CE19E02.
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
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Perrotin, P. Associating parallel automata network dynamics and strictly one-way cellular automata. Nat Comput 22, 453–461 (2023). https://doi.org/10.1007/s11047-023-09948-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-023-09948-z