On the convergence of Boolean automata networks without negative cycles

Abstract. Since the 1980’s, automata networks have been at the centre of numerous studies, from both theoretical (around the computational abilities) and applied (around the modelling power of real phenomena) standpoints. In this paper, basing ourselves on the seminal works of Robert and Thomas, we focus on a specific family of Boolean automata networks, those without negative cycles. For these networks, subjected to both asynchronous and elementary updating modes, we give new answers to well known problems (some of them having already been solved) about their convergence towards stable configurations. For the already solved ones, the proofs given are much simpler and neater than the existing ones. For the others, in any case, the proofs presented are constructive