Using the theories of finite automata and formal languages to determine observability of switched Boolean control networks

In this paper, how to determine the observability of switched Boolean control networks (SBCNs) is investigated. First, a new concept of weighted pair graph for an SBCN 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 tested by testing the completeness of the DFA. Based on these results, algorithms for determining the observability and the initial state are designed.