概率布尔控制网络的集可控

本文研究概率布尔控制网络的集可控性问题.首先,利用矩阵半张量积方法,得到概率布尔控制网络的代数表示.其次,借助一个新的算子构造不同的可控矩阵,进而通过可控矩阵考虑自由控制序列和网络输入控制下概率布尔控制网络的集可控性问题,得到了概率布尔控制网络集可控性的充要条件.最后,给出数值例子说明本文结果的有效性.     

布尔控制网络的能控性与能观性

利用矩阵的半张量积,布尔控制网络被转化为离散时间系统.本文从离散时间系统的结构矩阵出发,讨论了逻辑控制系统的能控能观性条件,得到了一个新的能控性条件.新的条件简化了原有能控性矩阵的计算复杂性,矩阵的最高阶数由原来的2m+n降到了2n.另外,还得到了检验布尔控制网络能观性的条件.与原有条件相比,新的条件更容易计算检验.最后,给出一个实例,检验给出的能控能观性判断条件的正确性.     

概率级联布尔网络的集镇定及其应用

随着系统生物学和医学的迅速发展,基因调控网络已经成为一个热点研究领域.布尔网络作为研究生物系统和基因调控网络的一种重要模型,近年来引起了包括生物学家和系统科学家在内的很多学者的广泛关注.本文利用代数状态空间方法,研究了概率级联布尔网络的集镇定问题.首先给出概率级联布尔网络集镇定的定义,并利用矩阵的半张量积给出了概率级联布尔网络的代数表示.其次基于该代数表示,定义了一组合适的概率能达集,并给出了概率级联布尔网络集镇定问题可解的充要条件.最后将所得的理论结果应用于概率级联布尔网络的同步分析及n人随机级联演化布尔博弈的策略一致演化行为分析.     

具有切换概率分布的概率布尔网络的依分布稳定和镇定

布尔网络作为研究基因调控网络的一种重要模型,近年来引起了国内外很多学者的广泛关注.本文利用代数状态空间表示方法,研究具有切换概率分布的概率布尔网络的依分布稳定和镇定问题.首先,回顾针对切换布尔网络稳定性分析的现有的研究结果.其次,给出具有切换概率分布的概率布尔网络依分布稳定的定义,并利用矩阵的半张量积建立具有切换概率分布的概率布尔网络的代数表示.再次,基于该代数表示,建立具有切换概率分布的概率布尔网络的依分布稳定的充分必要条件.最后,给出具有切换概率分布的概率布尔控制网络镇定问题可解的充要条件,并给出相应的控制设计方法.     

布尔控制网络的输出稳定与镇定

矩阵的半张量积是将逻辑变量转化为向量研究的主要工具.本文利用半张量积把逻辑控制系统表示为离散时间仿射线性系统,在逻辑系统的状态空间框架下研究了以布尔控制网络为代表的逻辑动态系统的输出稳定与镇定.首先给出布尔网络输出稳定的定义,研究了布尔网络输出稳定的充要条件;其次讨论了布尔控制网络的输出镇定,分别得到了布尔控制网络由常值输入变量、自由控制序列、状态反馈控制序列输出镇定的条件.本文讨论的系统输出稳定与镇定是(部分)变量稳定与镇定的推广.     

使用模型检测解决概率布尔网络优化控制

系统生物学期望对复杂生物系统建立一个真实的、可计算的模型,以便于以系统的角度去理解生物系统的演变过程。在系统生物学中,一个重要的主题是通过外部的干预控制发展关于基因调控网络的控制理论,以作为未来基因治疗技术。目前,布尔网络及其扩展的概率布尔网络已经被广泛用于对基因调控网络进行建模。在控制问题的研究中,概率布尔控制网络的状态迁移本质上构成一条有限状态空间的离散时间马尔科夫决策过程。依据马尔科夫决策过程的理论,通过概率模型检测方法解决网络中有限范围优化控制问题和无限范围优化控制问题。针对带有随机干扰且上下文相关的概率布尔控制网络,使用概率模型检测器PRISM对其进行形式化建模,然后将两类优化控制问题描述为相应的时序逻辑公式,最后通过模型检测寻找出最优解。实验结果表明,提出的方法可以有效地用于生物网络的分析和优化控制。     

基于牵制控制的切换布尔网络的分布式集合镇定

切换布尔网络是一种典型的网络化控制系统, 在基因调控、信息安全、人工智能、电路设计等领域具有重 要应用. 本文基于牵制控制方法, 研究切换布尔网络在任意切换下的分布式集合镇定问题. 首先, 利用矩阵半张量积 方法,得到切换布尔网络的代数形式. 其次, 基于代数形式, 提出构造性的算法来实现切换布尔网络在牵制控制的 作用下任意切换集合镇定, 并设计出状态反馈牵制控制器. 再次, 利用逻辑矩阵分解技术和分布式控制方法, 设计任 意切换下切换布尔网络的分布式集合镇定控制器, 并提出分布式控制器存在的充分条件. 文中给出3个例子来说明 所获得结果的有效性.     

块序列布尔网络的拓扑结构

利用矩阵的半张量积,通过建立逻辑变量与向量的对应,块序列布尔网络被表示为离散时间系统,将对序列布尔网络的研究转化为对结构矩阵的研究.块序列布尔网络的结构矩阵是一个逻辑矩阵,利用逻辑矩阵的1特征值与和1特征向量的特殊性质,从矩阵特征值和特征向量的角度研究了块序列布尔网络的拓扑结构,显式表示出了不同长度极限环的个数,并指出网络的极限环总数等于(2n-结构矩阵的秩).     

切换奇异布尔网络的稳定性分析

基因调控网络的稳定性分析是系统生物学的研究热点问题之一.本文利用矩阵半张量积方法研究了切换奇异布尔网络的稳定性问题.首先给出了切换奇异布尔网络的代数表示,基于该代数表示,建立了系统解存在唯一的充要条件.然后通过将切换奇异布尔网络转化为等价的切换布尔网络,分别得到了系统在任意切换下稳定以及切换可稳的充要条件.最后给出例子验证所得结果的有效性.     

布尔网络的分析与控制——矩阵半张量积方法

布尔网络是描述基因调控网络的一个有力工具. 由于系统生物学的发展, 布尔网络的分析与控制成为生物学与系统控制学科的交叉热点. 本文综述作者用其原创的矩阵半张量积方法在布尔网络的分析与控制中得到的一系列结果. 内容包括: 布尔网络的拓扑结构, 布尔控制网络的能控、能观性与实现, 布尔网络的稳定性和布尔控制网络的镇定, 布尔控制网络的干扰解耦, 布尔 (控制) 网络的辨识,以及布尔网络的最优控制等.     

On controllability and stabilizability of probabilistic Boolean control networks

The controllability of probabilistic Boolean control networks(PBCNs)is first considered.Using the input-state incidence matrices of all models,we propose a reachability matrix to characterize the joint reachability.Then we prove that the joint reachability and the controllability of PBCNs are equivalent,which leads to a necessary and sufcient condition of the controllability.Then,the result of controllability is used to investigate the stability of probabilistic Boolean networks(PBNs)and the stabilization of PBCNs.A necessary and sufcient condition for the stability of PBNs is obtained first.By introducing the control-fixed point of Boolean control networks(BCNs),the stability condition has finally been developed into a necessary and sufcient condition of the stabilization of PBCNs.Both necessary and sufcient conditions for controllability and stabilizability are based on reachability matrix,which are easily computable.Hence the two necessary and sufcient conditions are straightforward verifiable.Numerical examples are provided from case to case to demonstrate the corresponding theoretical results.     

Finite-time observability of probabilistic Boolean control networks

In this paper, the finite-time observability (FO ) of probabilistic Boolean control networks (PBCNs ) based on set reachability and parallel extension is investigated. Under algebraic state space representation of PBCNs , finite-time set reachability (FSR ), finite-time single input sequence set reachability (FSSSR ), finite-time arbitrary input sequence set reachability (FASSR ), as well as finite-time output feedback set reachability (FOSR ) are addressed, where some efficient criteria are proposed. In the second part of this paper, several types of FO are provided, which can be converted to the corresponding FSR based on the parallel extension technique. Consequently, the obtained results for FSR are utilized to deal with FO . Finally, two examples including a biological network are given to demonstrate the theoretical results.     

Subspace controllability of Boolean networks

Many Boolean control networks contain independent uncontrollable subnetworks, which may affect other nodes; and the rest of the system is called subspace of sub‐controllable states. This paper investigates the problem of subspace controllability under free input sequences, while the presumption that the initial states of those independent subnetworks are designable is canceled. An algorithm based on the common asymptotic periodic properties of the states is developed to find the reachable sets. Accordingly, the existing controllability criteria for subspaces when initial states of subnetworks are designable is improved, and a necessary and sufficient condition of subspace controllability via subnetworks and free inputs is derived. A design technique involving a kind of newly defined addition is presented to construct desired controls.     

Controllability of Boolean control networks avoiding states set

In this paper, using semi-tensor product and the vector form of Boolean logical variables, the Boolean control network （BCN） is expressed as a bilinear discrete time system about state and control variables. Based on the algebraic form, the reachability and controllability avoiding undesirable states set are discussed. The reachability and controllability discussed here are under certain constraint and tile definitions of reachability and controllability avoiding undesirable states set have practical meaning. Also, the necessary and sufficient conditions for reachability and controllability are given. At last, the control sequence that steers one state to another is constructed.     

Controllability of probabilistic Boolean control networks

This paper deals with the controllability of probabilistic Boolean control networks. First, a survey on the semi-tensor product approach to probabilistic Boolean networks is given. Second, the controllability of probabilistic Boolean control networks via two kinds inputs is studied. Finally, examples are given to show the efficiency of the obtained results.     

Output controllability and optimal output control of state-dependent switched Boolean control networks

In the present paper, we investigate the output-controllability and optimal output control problems of a state-dependent switched Boolean control network. By using the semi-tensor product, the algebraic form of the system is obtained. Then, output-controllability problems of the system are discussed and some necessary and sufficient conditions are given. Next, the Mayer-type optimal output control issue is considered and an algorithm is provided to find out the control sequence. At last, an example is given to show the effectiveness of the main results.     

Feedback control design for the complete synchronisation of two coupled Boolean networks

In the literatures, to design state feedback controllers to make the response Boolean network synchronise with the drive Boolean network is rarely considered. Motivated by this, feedback control design for the complete synchronisation of two coupled Boolean networks is investigated in this paper. A necessary condition for the existence of a state feedback controller achieving the complete synchronisation is established first. Then, based on the necessary condition, the feedback control law is proposed. Finally, an example is worked out to illustrate the proposed design procedure.