Control of Large-Scale Boolean Networks via Network Aggregation

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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transaction on neural networks and learning systems 2016-07, Vol.27 (7), p.1527-1536
Main Authors: Yin Zhao, Ghosh, Bijoy K., Daizhan Cheng
Format: Article
Language:English
Subjects:
Acyclic aggregation
Agglomeration
Boolean algebra
Boolean control network (BCN)
Computational complexity
Computational efficiency
Controllability
graph aggregation
Graphs
Learning
Learning systems
Networks
Neural networks
Nickel
Observability
stabilizability
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2162-237X
2162-2388
DOI:10.1109/TNNLS.2015.2442593