Existence and non existence of limit cycles in Boolean networks
From MaRDI portal
Publication:2086730
DOI10.1007/978-3-030-92551-2_15OpenAlexW4226521686MaRDI QIDQ2086730
Publication date: 25 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92551-2_15
Cites Work
- Unnamed Item
- Unnamed Item
- Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks
- Disjunctive networks and update schedules
- Computational complexity of threshold automata networks under different updating schemes
- Complexity of limit-cycle problems in Boolean networks
- Stability and looping in connectionist models with asymmetric weights
- Periodic behaviour of generalized threshold functions
- Limit cycles and update digraphs in Boolean networks
- The transition from differential equations to Boolean networks: A case study in simplifying a regulatory network model
- Discrete dynamical systems
- Cycle equivalence of graph dynamical systems
- Fixed Point Behavior of Threshold Functions on a Finite Set
This page was built for publication: Existence and non existence of limit cycles in Boolean networks
