Minimal observability of Boolean networks  

作　　者：Yang LIU Jie ZHONG Daniel W.C.HO Weihua GUI 

机构地区：[1]College of Mathematics and Computer Science,Zhejiang Normal University,Jinhua 321004,China [2]Department of Mathematics,City University of Hong Kong,Hong Kong 999077,China [3]School of Information Science and Engineering,Central South University,Changsha 410083,China

出　　处：《Science China(Information Sciences)》2022年第5期153-164,共12页中国科学（信息科学）（英文版）

基　　金：supported in part by Natural Science Foundation of Zhejiang Province of China(Grant Nos.LR20F030001,LY22F030005,LD19A010001);National Natural Science Foundation of China(Grant Nos.62173308,61903339)。

摘　　要：In this study,the minimum observability of Boolean networks(BNs)is investigated by using the semi-tensor product(STP)of matrices.First,a new system based on the considered BN is obtained to analyze states pair dynamic trajectories,from which a necessary and sufficient condition for the observability of BNs is determined.Second,adding a new observer improves the observability without affecting the observable states.Thus,an algorithm is presented to design an observer for an unobservable BN.In addition,a necessary condition is obtained to determine the minimum number of nodes required to be directly measurable.Further,an algorithm to address the minimal observability is presented.Finally,examples are provided to demonstrate the effectiveness of the obtained results.

关 键 词：Boolean networks minimal observability semi-tensor product 

分 类 号：O157.5[理学—数学]