Observability Decomposition of Boolean Control Networks under Several Kinds of Observability

• Published in: IEEE transactions on automatic control Vol. 69; no. 2; pp. 1 - 8
• Main Authors: Li, Yiliang, Feng, Jun-e, Cheng, Daizhan, Jia, Yingzhe
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.02.2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Automata; Boolean control networks; Controllability; Decomposition; distinguishability of states; Dynamical systems; Genetics; Graph theory; Matrix decomposition; Observability; observability decomposition; truth matrix
• ISSN: 0018-9286; 1558-2523
• DOI: 10.1109/TAC.2023.3300754

In this paper, a uniform method is provided to investigate the observability decomposition of Boolean control networks (BCNs) under different definitions of observability. Since the observability of BCNs is defined via the distinguishability of states, an algorithm is devised to identify and sort distinguishable states. To find the possible control sequences, a truth matrix reflecting the relationship between state pairs and control inputs is constructed. Using the truth matrix, necessary and sufficient conditions for several types of observability are given. Based on criteria for observability and some matrix discriminants, the realizability of observability decomposition is discussed. Notably, the proposed method is applicable to the observability decomposition under different definitions of observability, while the existing result is valid for only one type of observability. Furthermore, an example is introduced to illustrate the feasibility of the presented results.