Control of Large-Scale Boolean Networks via Network Aggregation
Control of Large-Scale Boolean Networks via Network Aggregation
复制标题
DOI：
10.1109/tnnls.2015.2442593
复制
发表时间：
2016-07
影响因子：
10.4
通讯作者：
Yin Zhao;B. Ghosh;D. Cheng
中科院分区：
文献类型：
--
作者：
Yin Zhao;B. Ghosh;D. Cheng
解决布尔网络控制问题的一个主要挑战是，随着网络中节点数量的增加，计算成本呈指数增长。我们考虑了布尔控制网络的可控性和稳定性问题，通过将网络图划分为若干个子网络来解决成本增加问题，并对每个子网络分别进行了分析。对于一般的聚集结构，给出了易于验证的可控和稳定的必要条件。对于无环聚集，给出了稳定性的充分条件。与整个布尔网络的节点数量相比，如果非环聚合的每个块中的节点数量足够小，则可以显著降低计算复杂度。
A major challenge to solve problems in control of Boolean networks is that the computational cost increases exponentially when the number of nodes in the network increases. We consider the problem of controllability and stabilizability of Boolean control networks, address the increasing cost problem by partitioning the network graph into several subnetworks, and analyze the subnetworks separately. Easily verifiable necessary conditions for controllability and stabilizability are proposed for a general aggregation structure. For acyclic aggregation, we develop a sufficient condition for stabilizability. It dramatically reduces the computational complexity if the number of nodes in each block of the acyclic aggregation is small enough compared with the number of nodes in the entire Boolean network.