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.
Type de document :
Communication dans un congrès
AUTOMATA 2017 23rd annual international workshop on cellular automata and discrete complex systems , Jun 2017, Milan, Italy. 2017
Liste complète des métadonnées

Littérature citée [5 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01785462
Contributeur : Kévin Perrot <>
Soumis le : vendredi 4 mai 2018 - 14:24:06
Dernière modification le : mercredi 18 juillet 2018 - 17:48:03
Document(s) archivé(s) le : mardi 25 septembre 2018 - 04:37:52

Fichier

2017-MontalvaPerrotOliveiraRui...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. 2017. 〈hal-01785462〉

Partager

Métriques

Consultations de la notice

40

Téléchargements de fichiers

6