Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks

Applied Sciences

Yunxiao Shan¹  Yuxin Cui¹  Shu Li¹  Fengqiu Liu² 

[1] School of Science, Harbin University of Science and Technology, Harbin 150080, China;School of Science, Ningbo University of Technology, Ningbo 315048, China;

关键词: finite-time set reachability;    semi-tensor product;    state transfer graph;    probabilistic Boolean multiplex control networks;   

DOI  :  10.3390/app12020883

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown