检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]Institute of Systems Science, Chinese Academy of Sciences
出 处:《Science China(Information Sciences)》2014年第1期174-187,共14页中国科学(信息科学)(英文版)
基 金:supported by National Natural Science Foundation of China(Grant Nos.61074114,60821091)
摘 要:The controllability of probabilistic Boolean control networks(PBCNs) is first considered. Using the input-state incidence matrices of all models, we propose a reachability matrix to characterize the joint reachability. Then we prove that the joint reachability and the controllability of PBCNs are equivalent, which leads to a necessary and sufcient condition of the controllability. Then, the result of controllability is used to investigate the stability of probabilistic Boolean networks(PBNs) and the stabilization of PBCNs. A necessary and sufcient condition for the stability of PBNs is obtained first. By introducing the control-fixed point of Boolean control networks(BCNs), the stability condition has finally been developed into a necessary and sufcient condition of the stabilization of PBCNs. Both necessary and sufcient conditions for controllability and stabilizability are based on reachability matrix, which are easily computable. Hence the two necessary and sufcient conditions are straightforward verifiable. Numerical examples are provided from case to case to demonstrate the corresponding theoretical results.The controllability of probabilistic Boolean control networks(PBCNs) is first considered. Using the input-state incidence matrices of all models, we propose a reachability matrix to characterize the joint reachability. Then we prove that the joint reachability and the controllability of PBCNs are equivalent, which leads to a necessary and sufcient condition of the controllability. Then, the result of controllability is used to investigate the stability of probabilistic Boolean networks(PBNs) and the stabilization of PBCNs. A necessary and sufcient condition for the stability of PBNs is obtained first. By introducing the control-fixed point of Boolean control networks(BCNs), the stability condition has finally been developed into a necessary and sufcient condition of the stabilization of PBCNs. Both necessary and sufcient conditions for controllability and stabilizability are based on reachability matrix, which are easily computable. Hence the two necessary and sufcient conditions are straightforward verifiable. Numerical examples are provided from case to case to demonstrate the corresponding theoretical results.
关 键 词:probabilistic Boolean control network CONTROLLABILITY STABILITY STABILIZATION semi-tensor product
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.221.83.96