Structural Controllability of Boolean Control Networks with known nodes coupling relationships

Note that state transition space of Boolean networks is determined by both network structure (node’s coupling relationships) and logical functions (update rules for nodes). This paper studies structural controllability of Boolean control networks (BCNs) under partial information, where only part of information about connections among nodes are known. Then, using semi-tensor product of matrices and algebraic forms of BCNs, two types of structural controllability are presented according to different cases of logical functions. Subsequently, certain sufficient and necessary criteria are established for structurally controllablility of BCNs with partial information. Finally, a numerical example is provided to illustrate the effectiveness of the obtained theoretical results.