Finite automata approach to observability of switched Boolean control networks. (February 2016)

• Record Type: Journal Article
• Authors: Zhang, Kuize; Zhang, Lijun; Xie, Lihua
• Is Part Of: Nonlinear analysis. Volume 19(2016)
• Page Start: 186
• Page End: 197
• Publication Date: 2016-02
• Subjects: Switched Boolean control network -- Observability -- Weighted pair graph -- Finite automaton -- Formal language -- Semi-tensor product of matrices; Nonlinear functional analysis -- Periodicals; Analyse fonctionnelle non linéaire -- Périodiques; Nonlinear functional analysis; Periodicals; 515.7248
• DOI: 10.1016/j.nahs.2015.10.002
• Languages: English
• ISSNs: 1751-570X

Abstract

Abstract: In this paper, the observability of switched Boolean control networks (SBCNs) is determined. First, a new concept of weighted pair graphs for SBCNs is defined. Second, the weighted pair graph is used to transform an SBCN into a deterministic finite automaton (DFA). Lastly, the observability of the SBCN is determined by testing the completeness of the DFA. Based on these results, algorithms for determining the observability and the initial state are designed. The computational complexity of this algorithm is doubly exponential in the number of nodes of SBCNs. Furthermore, more effective sufficient or necessary conditions for the observability of SBCNs are obtained directly from weighted pair graphs. The computational complexity of these conditions is exponential in the number of nodes of SBCNs.