Synchronism versus asynchronism in monotonic Boolean automata networks
From MaRDI portal
Publication:6062004
DOI10.1007/S11047-016-9608-8zbMATH Open1528.68191OpenAlexW2569099173MaRDI QIDQ6062004FDOQ6062004
Authors: Mathilde Noual, Sylvain Sené 
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
Recommendations
- Boolean networks synchronism sensitivity and XOR circulant networks convergence time
- About block-parallel Boolean networks: a position paper
- Asynchronous simulation of Boolean networks by monotone Boolean networks
- Boolean networks: beyond generalized asynchronicity
- Block-sequential update schedules and Boolean automata circuits
Boolean automata networksasynchronous transition graphelementary transition graphsensitivity to synchronismtime in interaction systems
Cites Work
- Computational aspects of asynchronous cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- A logical calculus of the ideas immanent in nervous activity
- Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority
- Asynchronous cellular automata and dynamical properties
- Boolean dynamics of networks with scale-free topology
- 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
- Comportement périodique des fonctions à seuil binaires et applications
- Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
- On limit cycles of monotone functions with symmetric connection graph
- Title not available (Why is that?)
- Frustration and overblocking on graphs
- Title not available (Why is that?)
- Boolean networks synchronism sensitivity and XOR circulant networks convergence time
Cited In (10)
- Learning any memory-less discrete semantics for dynamical systems represented by logic programs
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
- On simulation in automata networks
- Concurrency in Boolean networks
- About block-parallel Boolean networks: a position paper
- On the influence of the interaction graph on a finite dynamical system
- Linear cuts in Boolean networks
- Computing the probability of getting infected: on the counting complexity of bootstrap percolation
- Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata
- Modeling and Programming Asynchronous Automata Networks: The MOCA Approach
This page was built for publication: Synchronism versus asynchronism in monotonic Boolean automata networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062004)
