期刊
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS
卷 27, 期 7, 页码 1527-1536出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2015.2442593
关键词
Acyclic aggregation; Boolean control network (BCN); controllability; graph aggregation; stabilizability
类别
资金
- U.S. National Science Foundation through the National Stroke Foundation [1029178]
- National Natural Science Foundation of China [61273013, 61333001]
- Directorate For Engineering
- Div Of Electrical, Commun & Cyber Sys [1029178] Funding Source: National Science Foundation
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据