Asynchronous Boolean networks and hereditarily bijective maps
From MaRDI portal
Recommendations
- Boolean networks: beyond generalized asynchronicity
- Synchronizing Boolean networks asynchronously
- Interconnection of asynchronous Boolean networks, asymptotic and transient dynamics
- Asynchronous simulation of Boolean networks by monotone Boolean networks
- Attractor separation and signed cycles in asynchronous Boolean networks
- Signaling networks: asynchronous Boolean models
- On the flora of asynchronous locally non-monotonic Boolean automata networks
- Dynamics of Boolean networks
Cites work
- A combinatorial analogue of the Jacobian problem in automata networks
- A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks
- Asynchronous Boolean networks and hereditarily bijective maps
- Comparison between parallel and serial dynamics of Boolean networks
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- scientific article; zbMATH DE number 3771418 (Why is no real title available?)
- Local cycles and dynamical properties of Boolean networks
- Logical modelling of regulatory networks, methods and applications
- Multistationarity, the basis of cell differentiation and memory. I: Structural conditions of multistationarity and other nontrivial behavior
- Non-uniform cellular automata: classes, dynamics, and decidability
- On Differentiation and Homeostatic Behaviours of Boolean Dynamical Systems
- Qualitative dynamics of piecewise-linear differential equations: a discrete mapping approach
- The discrete Markus–Yamabe problem
Cited in
(3)
This page was built for publication: Asynchronous Boolean networks and hereditarily bijective maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003487)
