Sensitivity to synchronism in some boolean automata networks

Abstract : We study the sensitivity of some Boolean automata networks to changes in their dynamics against deterministic update perturbations. Due to their large number of different dynamics, they can be extremely sensitive to update schedule perturbations, which renders them not robust in this sense, a feature often undesirable in many applications. Here, we study the maximum number of different dynamics in elementary cellular automata, with fixed, cyclic lattices. First, we formally prove the estimate 3 n + 2 − 2 n+1 for such a number, empirically proposed in a previous work, as well as its sharpness, by proving that some rules actually reach it. Finally, we discuss possible key follow-ups to the present study.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01785462
Contributor : Kévin Perrot <>
Submitted on : Friday, May 4, 2018 - 2:24:06 PM
Last modification on : Monday, March 4, 2019 - 2:04:14 PM
Document(s) archivé(s) le : Tuesday, September 25, 2018 - 4:37:52 AM

File

2017-MontalvaPerrotOliveiraRui...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01785462, version 1

Collections

Citation

Marco Montalva Medel, Kévin Perrot, Pedro Oliveira, Eurico Ruivo. Sensitivity to synchronism in some boolean automata networks. AUTOMATA 2017 23rd annual international workshop on cellular automata and discrete complex systems , Jun 2017, Milan, Italy. ⟨hal-01785462⟩

Share

Metrics

Record views

45

Files downloads

7