HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 speci c 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 con gurations. 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.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Thursday, November 28, 2013 - 9:18:19 PM
Last modification on : Tuesday, December 7, 2021 - 4:10:10 PM
Long-term archiving on: : Monday, March 3, 2014 - 1:55:34 PM


Files produced by the author(s)



Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sené. On the convergence of Boolean automata networks without negative cycles. 19th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2013), Sep 2013, Gießen, Germany. pp.124--138, ⟨10.1007/978-3-642-40867-0_9⟩. ⟨hal-00832885⟩



Record views


Files downloads