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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied sciences 2022-01, Vol.12 (2), p.883
Hauptverfasser: Cui, Yuxin, Li, Shu, Shan, Yunxiao, Liu, Fengqiu
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Boolean
Boolean algebra
finite-time set reachability
Game theory
Multiplexing
probabilistic Boolean multiplex control networks
semi-tensor product
state transfer graph
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2076-3417
2076-3417
DOI:10.3390/app12020883