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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-01-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/12/2/883 |