Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks

Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks

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 th...

Full description

Bibliographic Details
Main Authors: Yuxin Cui, Shu Li, Yunxiao Shan, Fengqiu Liu
Format: Article
Language:English
Published: MDPI AG 2022-01-01
Series:Applied Sciences
Subjects:
finite-time set reachability
semi-tensor product
state transfer graph
probabilistic Boolean multiplex control networks
Online Access:https://www.mdpi.com/2076-3417/12/2/883

Internet

https://www.mdpi.com/2076-3417/12/2/883

Similar Items