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

DOI10.1016/J.ENTCS.2016.09.016MaRDI QIDQ1744360zbMATH OpenOpenAlexWikidataFDO

Authors Aurore Alcolei, Kévin Perrot, Sylvain Sené

Publication date 23 April 2018

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

zbMATH Keywords

non-monotonicityinteraction networksbehavioural equivalenceBoolean 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)

Abstract: Boolean automata networks (BANs) are a well established model for biological regulation systems such as neural networks or genetic networks. Studies on the dynamics of BANs, whether it is synchronous or asynchronous, have mainly focused on monotonic networks, where fundamental questions on the links relating their static and dynamical properties have been raised and addressed. This paper explores analogous questions on asynchronous non-monotonic networks, xor-BANs, that are BANs where all the local transition functions are xor-functions. Using algorithmic tools, we give a general characterisation of the asynchronous transition graphs for most of the cactus xor-BANs and strongly connected xor-BANs. As an illustration of the results, we provide a complete description of the asynchronous dynamics of two particular classes of xor-BAN, namely xor-Flowers and xor-Cycle Chains. This work also leads to new bisimulation equivalences specific to xor-BANs.

Recommendations

• About non-monotony in Boolean automata networks
• On Boolean automata networks (de)composition
• Boolean networks synchronism sensitivity and XOR circulant networks convergence time
• Asynchronous simulation of Boolean networks by monotone Boolean networks
• A framework for (de)composing with Boolean automata networks

Cites work

• scientific article; zbMATH DE number 4042465 (Why is no real title available?)
• About non-monotony in Boolean automata networks
• Asynchronous dynamics of Boolean automata double-cycles
• Boolean networks synchronism sensitivity and XOR circulant networks convergence time
• Combinatorics of Boolean automata circuits dynamics
• Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
• Fixed points of Boolean networks, guessing graphs, and coding theory
• Maximum number of fixed points in AND-OR-NOT networks
• Neural networks and physical systems with emergent collective computational abilities
• Neurons with graded response have collective computational properties like those of two-state neurons
• On the convergence of Boolean automata networks without negative cycles
• Relations between gene regulatory networks and cell dynamics in Boolean models
• The complexity of some edge deletion problems
• The dynamics of conjunctive and disjunctive Boolean network models

Cited in

(9)

• The number of fixed points of AND-OR networks with chain topology
• Boolean networks synchronism sensitivity and XOR circulant networks convergence time
• About non-monotony in Boolean automata networks
• Asynchronous simulation of Boolean networks by monotone Boolean networks
• Asynchronous Boolean networks and hereditarily bijective maps
• Stability structures of conjunctive Boolean networks
• A framework for (de)composing with Boolean automata networks
• Fixing monotone Boolean networks asynchronously
• On Boolean automata networks (de)composition

This page was built for publication: On the flora of asynchronous locally non-monotonic Boolean automata networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744360)