This paper investigates the reconstructibility of switched Boolean control networks (SBCNs). Several new types of definition about reconstructibility are proposed where the existence and arbitrariness of the switching signal and the input sequence are inconsistent. A weighted pair graph describing all pairs of states which are indistinguished is defined. A deterministic finite automata method is applied into the reconstructibility analysis. Accordingly, several algorithms are designed to determine these types of reconstructibility. Moreover, for a given reconstructible SBCN, an algorithm for determining the current state is provided. Finally, an example is provided to demonstrate the effectiveness of the proposed algorithms and results.

本文研究了交换布尔控制网络（SBCN）的可重构性。提出了几种关于可重构性的新定义，其中开关信号和输入序列的存在和任意性不一致。定义了一个加权对图，描述了所有无法区分的状态对。确定性有限自动机方法被应用于可重构性分析。因此，设计了几种算法来确定这些可重构性类型。而且，对于给定的可重构SBCN，提供了一种用于确定当前状态的算法。最后，提供了一个例子来说明所提出算法和结果的有效性。