About block-parallel Boolean networks: a position paper
From MaRDI portal
Abstract: In automata networks, it is well known that the way entities update their states over time has a major impact on their dynamics. In particular, depending on the chosen update schedule, the underlying dynamical systems may exhibit more or less asymptotic dynamical behaviours such as fixed points or limit cycles. Since such mathematical models have been used in the framework of biological networks modelling, the question of choosing appropriate update schedules has arised soon. In this note, focusing on Boolean networks, our aim is to emphasise that the adequate way of thinking regulations and genetic expression over time is certainly not to consider a wall segregating synchronicity from asynchronicity because they actually complement rather well. In particular, we highlight that specific update schedules, namely block-parallel update schedules, whose intrinsic features are still not known from a theoretical point of view, admit realistic and pertinent properties in the context of biological modelling and deserve certainly more attention from the community.
Recommendations
Cites work
- A logical calculus of the ideas immanent in nervous activity
- Block-sequential update schedules and Boolean automata circuits
- Blocs-H-matrices et convergence des méthodes itératives classiques par blocs
- Combinatorics of Boolean automata circuits dynamics
- Combinatorics on update digraphs in Boolean networks
- Discrete dynamical systems
- Discrete, sequential dynamical systems
- Disjunctive networks and update schedules
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- scientific article; zbMATH DE number 4042465 (Why is no real title available?)
- scientific article; zbMATH DE number 3771418 (Why is no real title available?)
- scientific article; zbMATH DE number 45557 (Why is no real title available?)
- Itérations sur des ensembles finis et automates cellulaires contractants
- Limit cycles and update digraphs in Boolean networks
- Necessary conditions for multistationarity in discrete dynamical systems
- On the number of different dynamics in Boolean networks with deterministic update schedules
- On the number of update digraphs and its relation with the feedback arc sets and tournaments
- Sequential dynamical systems over words
Cited in
(9)- On Boolean automata isolated cycles and tangential double-cycles dynamics
- Synchronism versus asynchronism in monotonic Boolean automata networks
- Concurrency in Boolean networks
- Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata
- Intrinsic universality in automata networks. III: On symmetry versus asynchrony
- Hardness of monadic second-order formulae over succinct graphs
- Foundations of block-parallel automata networks
- Robustness of Boolean networks to update modes: an application to hereditary angioedema
- Creation of fixed points in block-parallel Boolean automata networks
This page was built for publication: About block-parallel Boolean networks: a position paper
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151154)
