Synchronism versus asynchronism in monotonic Boolean automata networks

Abstract

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.