Synchronism versus asynchronism in monotonic Boolean automata networks
From MaRDI portal
Publication:6062004
DOI10.1007/s11047-016-9608-8zbMath1528.68191OpenAlexW2569099173MaRDI QIDQ6062004
Publication date: 30 November 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-016-9608-8
Boolean automata networksasynchronous transition graphelementary transition graphsensitivity to synchronismtime in interaction systems
Related Items (6)
On the influence of the interaction graph on a finite dynamical system ⋮ Concurrency in Boolean networks ⋮ Computing the probability of getting infected: on the counting complexity of bootstrap percolation ⋮ Learning any memory-less discrete semantics for dynamical systems represented by logic programs ⋮ On simulation in automata networks ⋮ \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- About non-monotony in Boolean automata networks
- Comparison between parallel and serial dynamics of Boolean networks
- Negative circuits and sustained oscillations in asynchronous automata networks
- Frustration and overblocking on graphs
- Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority
- Comportement périodique des fonctions à seuil binaires et applications
- Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
- Boolean dynamics of networks with scale-free topology
- On limit cycles of monotone functions with symmetric connection graph
- Asynchronous cellular automata and dynamical properties
- Computational Aspects of Asynchronous Cellular Automata
- A logical calculus of the ideas immanent in nervous activity
This page was built for publication: Synchronism versus asynchronism in monotonic Boolean automata networks
