Minimal Reconstructibility of Boolean Control Networks
研究了布尔控制网络的最小可重构性问题，基于半张量积方法，利用弱和强控制不变子集提出两种可重构性判据，并通过注入新测量将问题转化为方程求解，最后用生物实例说明两种定义不等价。
This article studies the minimal reconstructibility of Boolean control networks (BCNs) based on the semi-tensor product (STP). Two effective criteria for the reconstructibility of BCNs under two definitions are proposed by using weak control invariant subset (WCIS) and strong control invariant subset (SCIS). By injecting new measurements, a minimal reconstructibility problem (MRP) is established for achieving reconstructibility. Based on constructing an index matrix, the solution of the MRP is transformed into the solution of the equation. Finally, a biological example is given to illustrate the theoretical results and further emphasize the inequivalence of the two definitions.