Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks
Keyword(s):
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.
1988 ◽
Vol 30
(1)
◽
pp. 69-78
1996 ◽
Vol 33
(01)
◽
pp. 211-216
◽
2011 ◽
Vol 20
(07)
◽
pp. 1171-1182
◽
2006 ◽
Vol 57
(3)
◽
pp. 457-461
◽