A polynomial-time criterion for stability of large-scale switched conjunctive Boolean networks
From MaRDI portal
Publication:6537294
DOI10.1016/J.AUTOMATICA.2023.111340zbMATH Open1539.93139MaRDI QIDQ6537294
Publication date: 14 May 2024
Published in: Automatica (Search for Journal in Brave)
stabilitynode removallarge-scale networkpolynomial-time criterionswitched conjunctive Boolean network
Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Large-scale systems (93A15) Boolean control/observation systems (93C29) Networked control (93B70)
Cites Work
- On reachability and controllability of switched Boolean control networks
- The dynamics of conjunctive and disjunctive Boolean network models
- Set stability and set stabilization of Boolean control networks based on invariant subsets
- Analysis and control of Boolean networks. A semi-tensor product approach.
- Stability structures of conjunctive Boolean networks
- Minimal controllability of conjunctive Boolean networks is NP-complete
- Reduction of Boolean network models
- Set stability of switched delayed logical networks with application to finite-field consensus
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- Bistability and asynchrony in a Boolean model of the \textsc{L}-arabinose operon in \textit{Escherichia coli}
- Multistationarity, the basis of cell differentiation and memory. II: Logical analysis of regulatory networks in terms of feedback circuits
- Multistationarity, the basis of cell differentiation and memory. I: Structural conditions of multistationarity and other nontrivial behavior
- Stability Analysis for Switched Boolean Networks Under Arbitrary Switching Signals
- Controllability of Conjunctive Boolean Networks With Application to Gene Regulation
- Asymptotic Behavior of Conjunctive Boolean Networks Over Weakly Connected Digraphs
- A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks
- Observability, Reconstructibility and State Observers of Boolean Control Networks
- Aggregation Algorithm Towards Large-Scale Boolean Network Analysis
- Agent Transformation of Bayesian Games
This page was built for publication: A polynomial-time criterion for stability of large-scale switched conjunctive Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6537294)