Skip to Main content Skip to Navigation
New interface
Journal articles

Combinatorics of Boolean automata circuits dynamics

Abstract : In line with fields of theoretical computer science and biology that study Boolean automata networks to model regulation networks, we present some results concerning the dynamics of networks whose underlying structures are oriented cycles, 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 whose elements are updated in parallel. In particular, we give 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. We also relate the counting of attractors of Boolean automata circuits to other known combinatorial problems and give intuition about how circuits interact by studying their dynamics when they intersect one another in one point.
Complete list of metadata

Cited literature [40 references]  Display  Hide  Download
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Tuesday, February 11, 2014 - 12:49:56 PM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM
Long-term archiving on: : Monday, May 12, 2014 - 11:16:31 AM


Files produced by the author(s)



Jacques Demongeot, Mathilde Noual, Sylvain Sené. Combinatorics of Boolean automata circuits dynamics. Discrete Applied Mathematics, 2012, 160 (4-5), pp.398--415. ⟨10.1016/j.dam.2011.11.005⟩. ⟨hal-00666297⟩



Record views


Files downloads