On the Convergence of Boolean Automata Networks without Negative Cycles

DOI10.1007/978-3-642-40867-0_9zbMath1338.68187OpenAlexW103005945MaRDI QIDQ2851305

Sylvain Sené, Adrien Richard, Damien Regnault, Tarek Melliti

Publication date: 10 October 2013

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40867-0_9

zbMATH Keywords

cyclesBoolean automata networksmonotonyconvergence and convergence time

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (9)

Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Stability structures of conjunctive Boolean networks ⋮ Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks ⋮ Asynchronous Dynamics of Boolean Automata Double-Cycles ⋮ On Fixable Families of Boolean Networks ⋮ Fixing monotone Boolean networks asynchronously ⋮ Positive and negative cycles in Boolean networks ⋮ On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One ⋮ On the flora of asynchronous locally non-monotonic Boolean automata networks

This page was built for publication: On the Convergence of Boolean Automata Networks without Negative Cycles