Asynchronous Boolean networks and hereditarily bijective maps
From MaRDI portal
Publication:2003487
DOI10.1007/s11047-015-9523-4zbMath1416.92076OpenAlexW2156741721WikidataQ114224590 ScholiaQ114224590MaRDI QIDQ2003487
Publication date: 8 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-015-9523-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Logical modelling of regulatory networks, methods and applications
- Non-uniform cellular automata: classes, dynamics, and decidability
- Comparison between parallel and serial dynamics of Boolean networks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- A combinatorial analogue of the Jacobian problem in automata networks
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- Asynchronous Boolean networks and hereditarily bijective maps
- Multistationarity, the basis of cell differentiation and memory. I. Structural conditions of multistationarity and other nontrivial behavior
- 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
- Local cycles and dynamical properties of Boolean networks
This page was built for publication: Asynchronous Boolean networks and hereditarily bijective maps
