Top

Natural Computing

Published in:

09-06-2023

Associating parallel automata network dynamics and strictly one-way cellular automata

Author: Pacôme Perrotin

Published in: Natural Computing | Issue 3/2023

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

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.

previous article Linear cuts in Boolean networks

next article An exploration of reversible septenary number-conserving cellular automata: a survey of known methods

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

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–461MathSciNetCrossRef

Chopard B, Droz M (2005) Cellular automata modeling of physical systems. Cambridge University Press, CambridgeMATH

Davidich MI, Bornholdt S (2008) Boolean network model predicts cell cycle sequence of fission yeast. PLoS ONE 3:1672CrossRefMATH

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:11793CrossRef

Demongeot J, Noual M, Sené S (2012) Combinatorics of Boolean automata circuits dynamics. Discr Appl Math 160:398–415MathSciNetCrossRefMATH

Fuentes M, Kuperman M (1999) Cellular automata and epidemiological models with spatial dependence. Physica A 267(3–4):471–486CrossRef

Gao Z, Chen X, Başar T (2018) Stability structures of conjunctive Boolean networks. Automatica 89:8–20MathSciNetCrossRefMATH

Kari J (2005) Theory of cellular automata: a survey. Theoret Comput Sci 334(1–3):3–33MathSciNetCrossRefMATH

Kauffman SA (1969) Metabolic stability and epigenesis in randomly constructed genetic nets. J Theor Biol 22:437–467MathSciNetCrossRef

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–319CrossRef

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–107CrossRef

Thomas R (1973) Boolean formalization of genetic control circuits. J Theor Biol 42:563–585CrossRef

Title: Associating parallel automata network dynamics and strictly one-way cellular automata
Author: Pacôme Perrotin
Publication date: 09-06-2023
Publisher: Springer Netherlands
Published in: Natural Computing / Issue 3/2023
Print ISSN: 1567-7818
Electronic ISSN: 1572-9796
DOI: https://doi.org/10.1007/s11047-023-09948-z

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Other articles of this Issue 3/2023

On von Neumann regularity of cellular automata

Linear cuts in Boolean networks

Planar Rosa: a family of quasiperiodic substitution discrete plane tilings with 2n-fold rotational symmetry

Multiobjective evolutionary algorithm IDEA and k-means clustering for modeling multidimenional medical data based on fuzzy cognitive maps

Complexity of limit cycles with block-sequential update schedules in conjunctive networks

Cellular automata and substitutions in topological spaces defined via edit distances

Premium Partner