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:
Online Access:https://www.mdpi.com/2076-3417/12/2/883
_version_ 1797495976234057728
author Yuxin Cui
Shu Li
Yunxiao Shan
Fengqiu Liu
author_facet Yuxin Cui
Shu Li
Yunxiao Shan
Fengqiu Liu
author_sort Yuxin Cui
collection DOAJ
description 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.
first_indexed 2024-03-10T01:57:07Z
format Article
id doaj.art-ae61a889f42a4c1d94ed924e6b5cf961
institution Directory Open Access Journal
issn 2076-3417
language English
last_indexed 2024-03-10T01:57:07Z
publishDate 2022-01-01
publisher MDPI AG
record_format Article
series Applied Sciences
spelling doaj.art-ae61a889f42a4c1d94ed924e6b5cf9612023-11-23T12:54:34ZengMDPI AGApplied Sciences2076-34172022-01-0112288310.3390/app12020883Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control NetworksYuxin Cui0Shu Li1Yunxiao Shan2Fengqiu Liu3School of Science, Harbin University of Science and Technology, Harbin 150080, ChinaSchool of Science, Harbin University of Science and Technology, Harbin 150080, ChinaSchool of Science, Harbin University of Science and Technology, Harbin 150080, ChinaSchool of Science, Ningbo University of Technology, Ningbo 315048, ChinaThis 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.https://www.mdpi.com/2076-3417/12/2/883finite-time set reachabilitysemi-tensor productstate transfer graphprobabilistic Boolean multiplex control networks
spellingShingle Yuxin Cui
Shu Li
Yunxiao Shan
Fengqiu Liu
Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks
Applied Sciences
finite-time set reachability
semi-tensor product
state transfer graph
probabilistic Boolean multiplex control networks
title Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks
title_full Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks
title_fullStr Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks
title_full_unstemmed Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks
title_short Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks
title_sort finite time set reachability of probabilistic boolean multiplex control networks
topic finite-time set reachability
semi-tensor product
state transfer graph
probabilistic Boolean multiplex control networks
url https://www.mdpi.com/2076-3417/12/2/883
work_keys_str_mv AT yuxincui finitetimesetreachabilityofprobabilisticbooleanmultiplexcontrolnetworks
AT shuli finitetimesetreachabilityofprobabilisticbooleanmultiplexcontrolnetworks
AT yunxiaoshan finitetimesetreachabilityofprobabilisticbooleanmultiplexcontrolnetworks
AT fengqiuliu finitetimesetreachabilityofprobabilisticbooleanmultiplexcontrolnetworks