基于状态反馈求解布尔控制网络的可重构问题

Reconstruction of Boolean Control Networks via State Feedback

主要从图的角度研究了布尔控制网络(Boolean Control Network,BCN)可重构的条件。首先,从状态可区分的角度给出了BCN可重构的定义,为后续从状态转移图的角度来研究可重构问题奠定了基础。其次,给出了BCN中完美顶点划分的概念及其相关推论。随后,提出了可重构的一些充分和必要的条件。其中一个结果表明,当处理大型逻辑网络系统时,只需要考虑更少的节点来避免维数诅咒。最后,通过一个具体的生物学实例和一个具体的例子说明所得到的结果。

This paper mainly studies the conditions under Boolean control networks(BCN)are reconstructable from the view of graph.Firstly,the reconstructable definition of BCN is given from the point of view of state distinguish.It lays a foundation for the subsequent study of reconstructable problem from the view of state transition graph.Secondly,perfect vertex partitions in BCN and its correlative corollaries are given.Thirdly,we give some sufficient and necessary conditions for reconstruction.One of the results shows when dealing with large logical network systems,we can only consider fewer nodes to avoid the curse of dimension.Finally,the biological example is given to illustrate the results obtained.