Observability of Boolean control networks:A unified approach based on the theories of finite automata and formal languages
In this paper,we solve a basic problem of whether there are algorithms to determine the observability of Boolean control networks(BCNs).In fact,we give a unified approach to design algorithms to judge whether a given BCN is observable with respect to different observability.In this work,an algorithm determining the observability of BCNs is a deterministic mechanical procedure that receives a BCN and after a finite number of processing steps it returns “Yes,if the BCN is observable; and returns “No,otherwise.First,we investigate the implication relationship between different observability of BCNs,which are the most general observability,i.e.,any two distinct states can be distinguished by a designed control sequence,and the observability proposed in D.Cheng,H.Qi(2009).Controllability and observability of Boolean control networks,Automatica,45(7),1659–1667. and D.Cheng,Y.Zhao(2011).Identification of Boolean control networks,Automatica,47,702–710.,respectively.Second,we put forward a concept of weighted pair graph for BCNs,using which,based on the theories of finite automata and formal languages,we give equivalent test criteria and further design algorithms to judge whether a given BCN is observable with respect to these observability,respectively,in the framework of the semi-tensor product of matrices.
Boolean control network Observability Semi-tensor product of matrices Weighted pair graph Finite automaton Formal language
ZHANG Kuize ZHANG Lijun
College of Automation,Harbin Engineering University,Harbin,150001,PR China;EXQUISITUS,Centre for E-C School of Marine Technology,Northwestern Polytechnical University,Xian,710072,PR China;College of A
国际会议
The 33th Chinese Control Conference第33届中国控制会议
南京
英文
6854-6861
2014-07-28（万方平台首次上网日期，不代表论文的发表时间）