Control of large-scale boolean networks via network aggregation

Yin Zhao, Bijoy K. Ghosh, Daizhan Cheng

Research output: Contribution to journalArticlepeer-review

50 Scopus citations


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.

Original languageEnglish
Article number7173058
Pages (from-to)1527-1536
Number of pages10
JournalIEEE Transactions on Neural Networks and Learning Systems
Issue number7
StatePublished - Jul 2016


  • Acyclic aggregation
  • Boolean control network (BCN)
  • Controllability
  • Graph aggregation
  • Stabilizability


Dive into the research topics of 'Control of large-scale boolean networks via network aggregation'. Together they form a unique fingerprint.

Cite this