Cascading decomposition of Boolean control networks:a graph-theoretical method  

布尔控制网络的级联分解:一种图论方法（英文）

作　　者：Yi-feng LI Jian-dong ZHU 

机构地区：[1]Institute of Mathematics,School of Mathematical Sciences,Nanjing Normal University,Nanjing 210023,China

出　　处：《Frontiers of Information Technology & Electronic Engineering》2020年第2期304-315,共12页信息与电子工程前沿（英文版）

基　　金：Project supported by the National Natural Science Foundation of China(No.61673012)。

摘　　要：Two types of cascading decomposition problems of Boolean control networks are investigated using a graph-theoretical method.A new graphic concept called nested perfect equal vertex partition(NPEVP)is proposed.Based on NPEVP,the necessary and sufficient graphic conditions for solvability of the cascading decomposition problems are obtained.Given the proposed graphic conditions,the logical coordinate transformations are constructively obtained to realize the corresponding cascading decomposition forms.Finally,two illustrative examples are provided to validate the results.Two types of cascading decomposition problems of Boolean control networks are investigated using a graph-theoretical method. A new graphic concept called nested perfect equal vertex partition(NPEVP) is proposed.Based on NPEVP, the necessary and sufficient graphic conditions for solvability of the cascading decomposition problems are obtained. Given the proposed graphic conditions, the logical coordinate transformations are constructively obtained to realize the corresponding cascading decomposition forms. Finally, two illustrative examples are provided to validate the results.

关 键 词：BOOLEAN control networks Semi-tensor product CASCADING DECOMPOSITION GRAPHIC condition 

分 类 号：O231[理学—运筹学与控制论]