On the convergence of Boolean automata networks without negative cycles

Abstract : Since the 1980's, automata networks have been at the centre of numerous studies, from both theoretical (around the computational abilities) and applied (around the modelling power of real phenomena) standpoints. In this paper, basing ourselves on the seminal works of Robert and Thomas, we focus on a speci c family of Boolean automata networks, those without negative cycles. For these networks, subjected to both asynchronous and elementary updating modes, we give new answers to well known problems (some of them having already been solved) about their convergence towards stable con gurations. For the already solved ones, the proofs given are much simpler and neater than the existing ones. For the others, in any case, the proofs presented are constructive.
Type de document :
Communication dans un congrès
19th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2013), Sep 2013, Gießen, Germany. 8155, pp.124--138, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-40867-0_9〉
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-00832885
Contributeur : Frédéric Davesne <>
Soumis le : jeudi 28 novembre 2013 - 21:18:19
Dernière modification le : jeudi 9 février 2017 - 15:48:36
Document(s) archivé(s) le : lundi 3 mars 2014 - 13:55:34

Fichier

XOR.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sené. On the convergence of Boolean automata networks without negative cycles. 19th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2013), Sep 2013, Gießen, Germany. 8155, pp.124--138, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-40867-0_9〉. 〈hal-00832885〉

Partager

Métriques

Consultations de
la notice

349

Téléchargements du document

120