Sensitivity to Synchronism of Boolean Automata Networks

Abstract. We are interested in the way time impacts on the behaviours of interaction systems. We approach this question in a discrete frame-work and with a relative notion of time flow. In this paper, we focus 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. Based on this, we define different sorts 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