Block-sequential update schedules and Boolean automata circuits - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

Block-sequential update schedules and Boolean automata circuits


Our work is set in the framework of complex dynamical systems and, more precisely, that of Boolean automata networks modeling regulation networks. We study how the choice of an update schedule impacts on the dynamics of such a network. To do this, we explain how studying the dynamics of any network updated with an arbitrary block-sequential update schedule can be reduced to the study of the dynamics of a different network updated in parallel. We give special attention to networks whose underlying structure is a circuit, that is, Boolean automata circuits. These particular and simple networks are known to serve as the "engines'' of the dynamics of arbitrary regulation networks containing them as sub-networks in that they are responsible for their variety of dynamical behaviours. We give both the number of attractors of period $p$, $\forall p\in \mathbb{N}$ and the total number of attractors in the dynamics of Boolean automata circuits updated with any block-sequential update schedule. We also detail the variety of dynamical behaviours that such networks may exhibit according to the update schedule.
Fichier principal
Vignette du fichier
dmAL0104.pdf (342.5 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01185498 , version 1 (20-08-2015)



Eric Goles, Mathilde Noual. Block-sequential update schedules and Boolean automata circuits. Automata 2010 - 16th Intl. Workshop on CA and DCS, 2010, Nancy, France. pp.41-50, ⟨10.46298/dmtcs.2762⟩. ⟨hal-01185498⟩
350 View
607 Download



Gmail Facebook X LinkedIn More