System decomposition with respect to inputs for Boolean control networks

详细信息    查看全文

• 作者：Yunlei Zou ^{zouyl0903@163.com" class="auth_mail}Author Vitae ; Jiandong Zhu¹ ; ^{zhujiandong@njnu.edu.cn" class="auth_mail}Author Vitae
• 关键词：Boolean control networks ; System decomposition ; Normal controllable form ; Semi-tensor product ; Perfect equal vertex partition ; Vertex set uniting algorithm
• 刊名：Automatica
• 出版年：April, 2014
• 年：2014
• 卷：50
• 期：4
• 页码：1304-1309
• 全文大小：611 K

文摘

In this paper, the problem of system decomposition with respect to inputs is investigated for Boolean control networks (BCNs). First, based on the linear representation of BCNs, some algebraic equivalent conditions for the decomposability are obtained. Second, the concept of perfect equal vertex partition (PEVP) is proposed for BCNs. A necessary and sufficient graphical condition for the decomposability, i.e.聽the existence of a PEVP, is proposed. Third, for calculating a PEVP, an algorithm called Vertex Set Uniting Algorithm (VSUA) is designed. Finally, a biological example is analyzed to show the effectiveness of the proposed method.