Abstract
The asynchronous dynamics associated with a Boolean network \(f:\{0,1\}^n\rightarrow \{0,1\}^n\) is a finite deterministic automaton considered in many applications. The set of states is \(\{0,1\}^n\), the alphabet is [n], and the action of letter i on a state x consists in either switching the ith component if \(f_i(x)\ne x_i\) or doing nothing otherwise. This action is extended to words in the natural way. We then say that a word w fixes f if, for all states x, the result of the action of w on x is a fixed point of f. A whole family of networks is fixable if its members are all fixed by the same word, and the fixing length of the family is the minimum length of such a word. In this paper, which is building closely on [2] where these notions have been introduced, we are interested in families of Boolean networks with relatively small fixing lengths. Firstly, we prove that fixing length of the family of networks with acyclic asynchronous graphs is \(\varTheta (n 2^n)\). Secondly, it is known that the fixing length of the whole family of monotone networks is \(O(n^3)\). We then exhibit two families of monotone networks with fixing length \(\varTheta (n)\) and \(\varTheta (n^2)\) respectively, namely monotone networks with tree interaction graphs and conjunctive networks with symmetric interaction graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abou-Jaoudé, W., et al.: Logical modeling and dynamical analysis of cellular networks. Front. Genet. 7, 94 (2016)
Aracena, J., Gadouleau, M., Richard, A., Salinas, L.: Fixing monotone Boolean networks asynchronously (2018, submitted). https://arxiv.org/abs/1802.02068
Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2008). https://doi.org/10.1007/978-1-84800-998-1
Bollobás, B., Gotsman, C., Shamir, E.: Connectivity and dynamics for random subgraphs of the directed cube. Isr. J. Math. 83, 321–328 (1993)
Gilbert, E.N.: Gray codes and paths on the n-cube. Bell Labs Tech. J. 37, 815–826 (1958)
Melliti, T., Regnault, D., Richard, A., Sené, S.: On the convergence of boolean automata networks without negative cycles. In: Kari, J., Kutrib, M., Malcher, A. (eds.) AUTOMATA 2013. LNCS, vol. 8155, pp. 124–138. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40867-0_9
Melliti, T., Regnault, D., Richard, A., Sené, S.: Asynchronous simulation of boolean networks by monotone boolean networks. In: El Yacoubi, S., Wąs, J., Bandini, S. (eds.) ACRI 2016. LNCS, vol. 9863, pp. 182–191. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44365-2_18
Robert, F.: Iterations sur des ensembles finis et automates cellulaires contractants. Linear Algebra Appl. 29, 393–412 (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Gadouleau, M., Richard, A. (2018). On Fixable Families of Boolean Networks. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds) Cellular Automata. ACRI 2018. Lecture Notes in Computer Science(), vol 11115. Springer, Cham. https://doi.org/10.1007/978-3-319-99813-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-99813-8_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99812-1
Online ISBN: 978-3-319-99813-8
eBook Packages: Computer ScienceComputer Science (R0)