Finite-time controllability and stabilization of probabilistic logical systems with state-dependent constraint via subset transition method
From MaRDI portal
Publication:6099889
DOI10.1016/j.jfranklin.2023.04.016zbMath1516.93221OpenAlexW4366526062MaRDI QIDQ6099889
Publication date: 21 June 2023
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2023.04.016
Cites Work
- Controllability of Boolean control networks via the Perron-Frobenius theory
- On finite potential games
- Identification of Boolean control networks
- On controllability and stabilizability of probabilistic Boolean control networks
- Set stability and set stabilization of Boolean control networks based on invariant subsets
- Analysis and control of Boolean networks. A semi-tensor product approach.
- Observability of Boolean networks via set controllability approach
- Feedback stabilization control design for switched Boolean control networks
- Algebraic formulation and strategy optimization for a class of evolutionary networked games via semi-tensor product method
- Controllability Analysis and Control Design for Switched Boolean Networks with State and Input Constraints
- Modeling, Analysis and Control of Networked Evolutionary Games
- Optimal infinite-horizon control for probabilistic Boolean networks
- FINDING CYCLES IN SYNCHRONOUS BOOLEAN NETWORKS WITH APPLICATIONS TO BIOCHEMICAL SYSTEMS
- Filtering for Nonlinear Genetic Regulatory Networks With Stochastic Disturbances
- Observability, Reconstructibility and State Observers of Boolean Control Networks