A Nonaugmented Method for the Minimal Observability of Boolean Networks
提出一种非增广方法研究布尔网络的最小可观测性问题，通过分类不可观测状态并设计算法，找出使网络可观测所需的最少额外测量，适用于更一般的布尔网络且降低计算复杂度。
This article proposes a nonaugmented method for investigating the minimal observability problem of Boolean networks (BNs). This method can be applied to more general BNs and reduce the computational and space complexity of existing results. First, unobservable states concerning an unobservable BN are classified into three categories using the vertex-colored state transition graph, each accompanied by a necessary and sufficient condition for determining additional measurements to make them distinguishable. Then, an algorithm is designed to identify the additional measurements that would render an unobservable BN observable using the conditions. Next, to determine the minimum added measurements, a necessary and sufficient condition and an algorithm based on a constructed matrix are presented. Finally, the results obtained are compared with existing literature and illustrated with examples.