Sensitivity to synchronism in some boolean automata networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Sensitivity to synchronism in some boolean automata networks

Résumé

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.
Fichier principal
Vignette du fichier
2017-MontalvaPerrotOliveiraRuivo-synchronismSensitivity-AUTOMATA-preprint.pdf (271.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01785462 , version 1 (04-05-2018)

Identifiants

  • HAL Id : hal-01785462 , version 1

Citer

Marco Montalva Medel, Kévin Perrot, Pedro De 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⟩
72 Consultations
23 Téléchargements

Partager

Gmail Facebook X LinkedIn More