Combinatorics of Boolean automata circuits dynamics

DOI10.1016/j.dam.2011.11.005zbMath1238.37035OpenAlexW1980710953MaRDI QIDQ412329

Jacques Demongeot, Mathilde Noual, Sylvain Sené

Publication date: 4 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.005

zbMATH Keywords

asymptotic behaviourattractordiscrete dynamical systemBoolean automata networkpositive and negative circuit

Mathematics Subject Classification ID

Applications of graph theory (05C90) Formal languages and automata (68Q45) Dynamical systems in biology (37N25) Systems biology, networks (92C42)

Related Items (19)

Complexity of fixed point counting problems in Boolean networks ⋮ Simple dynamics on graphs ⋮ Complexity of limit-cycle problems in Boolean networks ⋮ On circuit functionality in Boolean networks ⋮ Asynchronous Dynamics of Boolean Automata Double-Cycles ⋮ About non-monotony in Boolean automata networks ⋮ Robustness in biological regulatory networks. IV: Application to genetic networks controlling the cell cycle ⋮ Turning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamics ⋮ About block-parallel Boolean networks: a position paper ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ Positive and negative cycles in Boolean networks ⋮ Memory in plants: Boolean modeling of the learning and store/recall memory functions in response to environmental stimuli ⋮ Optimising attractor computation in Boolean automata networks ⋮ On the flora of asynchronous locally non-monotonic Boolean automata networks ⋮ Fixed points and connections between positive and negative cycles in Boolean networks ⋮ ``Immunetworks, intersecting circuits and dynamics ⋮ On Boolean automata isolated cycles and tangential double-cycles dynamics ⋮ Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks ⋮ LINEAR AND NONLINEAR ARABESQUES: A STUDY OF CLOSED CHAINS OF NEGATIVE 2-ELEMENT CIRCUITS

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
• Negative circuits and sustained oscillations in asynchronous automata networks
• Positive circuits and maximal number of fixed points in discrete dynamical systems
• Comportement périodique des fonctions à seuil binaires et applications
• Specific roles of the different Boolean mappings in random networks
• Lexicographic compositions and de Bruijn sequences
• On the iteration of certain quadratic maps over GF(\(p\)).
• Fixed points and maximal independent sets in AND-OR networks
• Transient length in sequential iteration of threshold functions
• On limit cycles of monotone functions with symmetric connection graph
• Boundary conditions and phase transitions in neural networks. Theoretical results
• A new necessary condition on interaction graphs for multistationarity
• Necessary conditions for multistationarity in discrete dynamical systems
• Necessary Conditions for Multistationarity and Stable Periodicity
• Fixed Point Behavior of Threshold Functions on a Finite Set
• Neural networks and physical systems with emergent collective computational abilities.
• Neurons with graded response have collective computational properties like those of two-state neurons.
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: Combinatorics of Boolean automata circuits dynamics