Synchronism versus asynchronism in monotonic Boolean automata networks
- 153 Downloads
This paper focuses on Boolean automata networks and the updatings of automata states in these networks. More specifically, we study how synchronous updates impact on the global behaviour of a network. On this basis, we define different types of network sensitivity to synchronism, which are effectively satisfied by some networks. We also relate this synchronism-sensitivity to some properties of the structure of networks and to their underlying mechanisms.
KeywordsBoolean automata networks Sensitivity to synchronism Asynchronous transition graph Elementary transition graph Time in interaction systems
This work has been partially supported by the project PACA APEX FRI.
- Chandesris J, Dennunzio A, Formenti E, Manzoni L (2011) Computational aspects of asynchronous cellular automata. In: Proceedings of DLT, lecture notes in computer science, vol 6795, pp 466–468. Springer, BerlinGoogle Scholar
- Choffrut C (ed) (1988) Automata networks, lecture notes in computer science, vol 316. Springer, BerlinGoogle Scholar
- Cosnard M, Demongeot J (1985) Iteration theory and its functional equations, lecture notes in mathematics, vol 1163, chap. On the definition of attractors, Springer, Berlin, pp 23–31Google Scholar
- Floréen P (1992) Computational complexity problems in neural associative memories. PhD thesis, University of HelsinkiGoogle Scholar
- Harvey I, Bossomaier T (1997) Time out of joint: attractors in asynchronous random Boolean networks. In: Proceedings of ECAL, MIT Press, Cambridge, pp 67–75Google Scholar
- Kleene SC (1956) Automata studies, annals of mathematics studies, vol 34, chap. Representation of events in nerve nets and finite automata, Princeton Universtity Press, Princeton, pp 3–41Google Scholar
- Noual M, Regnault D, Sené S (2012) Boolean networks synchronism sensitivity and XOR circulant networks convergence time. In: Full papers proceedings of AUTOMATA & JAC’2012, electronic proceedings in theoretical computer science, vol 90, Open Publishing Association, pp 37–52Google Scholar
- Saint Savage N (2005) The effects of state dependent and state independent probabilistic updating on Boolean network dynamics. PhD thesis, University of ManchesterGoogle Scholar
- Toulouse G (1977) Theory of the frustration effect in spin glasses. I. Commun Phys 2:115–119Google Scholar
- von Neumann J (1966) Theory of self-reproducing automata. University of Illinois Press, ChampaignGoogle Scholar