On the flora of asynchronous locally non-monotonic Boolean automata networks

DOI10.1016/j.entcs.2016.09.016zbMath1401.68140arXiv1510.05452OpenAlexW2608710963WikidataQ113317657 ScholiaQ113317657MaRDI QIDQ1744360

Kévin Perrot, Aurore Alcolei, Sylvain Sené

Publication date: 23 April 2018

Full work available at URL: https://arxiv.org/abs/1510.05452

zbMATH Keywords

behavioural equivalencenon-monotonicityinteraction networksBoolean automata networksasynchronous dynamics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Systems biology, networks (92C42)

Related Items

Stability structures of conjunctive Boolean networks ⋮ On Boolean Automata Networks (de)Composition1 ⋮ The number of fixed points of AND-OR networks with chain topology

Cites Work

• Unnamed Item
• Unnamed Item
• About non-monotony in Boolean automata networks
• Combinatorics of Boolean automata circuits dynamics
• The dynamics of conjunctive and disjunctive Boolean network models
• Relations between gene regulatory networks and cell dynamics in Boolean models
• Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
• Maximum number of fixed points in AND-OR-NOT networks
• On the Convergence of Boolean Automata Networks without Negative Cycles
• Asynchronous Dynamics of Boolean Automata Double-Cycles
• Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
• The complexity of some edge deletion problems
• Neural networks and physical systems with emergent collective computational abilities.
• Neurons with graded response have collective computational properties like those of two-state neurons.