scholarly journals Finite-Time Controllability and Set Controllability of Impulsive Probabilistic Boolean Control Networks

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 111995-112002 ◽  
Author(s):  
Jing Wang ◽  
Yansheng Liu ◽  
Haitao Li
Keyword(s):  
Finite Time ◽  
Control Networks

Finite-time output tracking of probabilistic Boolean control networks

2021 ◽  
Vol 411 ◽  
pp. 126413
Author(s):  
Anguo Zhang ◽  
Lulu Li ◽  
Yuanyuan Li ◽  
Jianquan Lu
Keyword(s):  
Finite Time ◽  
Control Networks ◽  
Output Tracking

scholarly journals Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks

2022 ◽  
Vol 12 (2) ◽  
pp. 883
Author(s):  
Yuxin Cui ◽  
Shu Li ◽  
Yunxiao Shan ◽  
Fengqiu Liu
Keyword(s):  
Dynamical Systems ◽  
Finite Time ◽  
The State ◽  
Reconstruction Technique ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Control Networks ◽  
State Transfer ◽  
Necessary And Sufficient

This study focuses on the finite-time set reachability of probabilistic Boolean multiplex control networks (PBMCNs). Firstly, based on the state transfer graph (STG) reconstruction technique, the PBMCNs are extended to random logic dynamical systems. Then, a necessary and sufficient condition for the finite-time set reachability of PBMCNs is obtained. Finally, the obtained results are effectively illustrated by an example.

Sign in / Sign up

Export Citation Format

Share Document