On the Number of Attractors of Positive and Negative Boolean Automata Circuits. - Université Jean Moulin Lyon 3 Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

On the Number of Attractors of Positive and Negative Boolean Automata Circuits.

Résumé

In line with fields of theoretical computer science and biology that study Boolean automata networks often seen as models of regulation networks, we present some results concerning the dynamics of networks whose underlying interaction graphs are circuits, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain them. Our work focuses on the number of attractors of Boolean automata circuits. We prove how to obtain formally the exact value of the total number of attractors of a circuit of arbitrary size n as well as, for every positive integer p, the number of its attractors of period p depending on whether the circuit has an even or an odd number of inhibitions. As a consequence, we obtain that both numbers depend only on the parity of the number of inhibitions and not on their distribution along the circuit.
Fichier principal
Vignette du fichier
dns10.pdf (179.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00647877 , version 1 (14-02-2014)

Identifiants

Citer

Jacques Demongeot, Mathilde Noual, Sylvain Sené. On the Number of Attractors of Positive and Negative Boolean Automata Circuits.. 24th IEEE International Conference on Advanced Information Networking and Applications Workshops (WAINA 2010), Apr 2010, Perth, WA, Australia. pp.782--789, ⟨10.1109/WAINA.2010.141⟩. ⟨hal-00647877⟩
863 Consultations
252 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More