Asynchronous dynamics of boolean automata double-cycles

Tarek Melliti (1) , Mathilde Noual (2) , Damien Regnault (1) , Sylvain Sené (2, 3) , Jérémy Sobieraj (1)

1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
2 LIF - Laboratoire d'informatique Fondamentale de Marseille
3 IXXI - Institut Rhône-Alpin des systèmes complexes

Because interaction networks occupy more and more space in our current life (social networks) and in our understanding of living systems(biological regulation networks), it seems necessary to develop the knowledge regarding them. By using Boolean automata networks as models of interaction networks, we present new results about the influence of cycles on their dynamics. Cycles in the architecture of boolean networks are known to be the primary engine of dynamical complexity. As a first particular case, we focus on cycle intersections and provide a characterisation of the dynamics of asynchronous Boolean automata networks composed of two cycles that intersect at one automaton. To do so, we introduce an efficient formalism inspired by algorithms to define long sequences of updates, which allows a more efficient description of their dynamics.

Mots clés: Asynchronous dynamics; Boolean automata networks; Double-cycles; Interaction networks

Domaines: Informatique [cs]

Tarek Melliti, Mathilde Noual, Damien Regnault, Sylvain Sené, Jérémy Sobieraj. Asynchronous dynamics of boolean automata double-cycles. 14th International Conference on Unconventional Computation and Natural Computation (UCNC 2015), Aug 2015, Auckland, New Zealand. pp.250--262, ⟨10.1007/978-3-319-21819-9_19⟩. ⟨hal-01218013⟩