Self-Triggered Set Stabilization of Boolean Control Networks and Its Applications

Set stabilization is one of the essential problems in engineering systems, and self-triggered control(STC) can save the storage space for interactive information, and can be successfully applied in networked control systems with limited communication resources. In this study, the set stabilization problem and STC design of Boolean control networks are investigated via the semi-tensor product technique. On the one hand, the largest control invariant subset is calculated in terms of the strongly connected components of the state transition graph, by which a graph-theoretical condition for set stabilization is derived. On the other hand, a characteristic function is exploited to determine the triggering mechanism and feasible controls. Based on this, the minimum-time and minimum-triggering open-loop, state-feedback and output-feedback STCs for set stabilization are designed,respectively. As classic applications of self-triggered set stabilization, self-triggered synchronization, self-triggered output tracking and self-triggered output regulation are discussed as well. Additionally, several practical examples are given to illustrate the effectiveness of theoretical results.

Context-Aware System Modeling Based on Boolean Control Network

Boolean control network consists of a set of Boolean variables whose state is determined by other variables in the network. Boolean network is used for modeling complex system. In this paper, we have presented a model of a context-aware system used in smart home based on Boolean control networks. This modeling describes the relationship between the context elements (person, time, location, and activity) and services (Morning Call, Sleeping, Guarding, Entertainment, and normal), which is effective to logical inference. We apply semi tensor matrix product to describe the dynamic of the system. This matrix form of expression is a convenient and reasonable way to design logic control system.

Observability of Boolean Control Networks with Time-Variant Delays in States

This paper gives an equivalent condition for the observability of Boolean control networks（BCNs） with time-variant delays in states under a mild assumption by using the graph-theoretic method under the framework of the semi-tensor product of matrices. First, the BCN under consideration is split into a finite number of subsystems with no time delays. Second, the observability of the BCN is verified by testing the observability of the so-called observability constructed path（a special subsystem without time delays） based on graph theory. These results extend the recent related results on the observability of BCNs. Examples are shown to illustrate the effectiveness of the results.

Graph Theory Methods for Decomposition w.r.t. Outputs of Boolean Control Networks

This paper focuses graph theory method for the problem of decomposition w.r.t. outputs for Boolean control networks(BCNs). First, by resorting to the semi-tensor product of matrices and the matrix expression of BCNs, the definition of decomposition w.r.t. outputs is introduced. Second, by referring to the graphical structure of BCNs, a necessary and sufficient condition for the decomposition w.r.t. outputs is obtained based on graph theory method. Third, an effective algorithm to realize the maximum decomposition w.r.t. outputs is proposed. Finally, some examples are addressed to validate the theoretical results.

Morgan＇s problem of Boolean control networks

This paper investigates the Morgan＇s problem of Boolean control networks. Based on the matrix expression of logical functions, two key steps are proposed to solve the problem. First, the Boolean control network is converted into an output- decomposed form by constructing a set of consistent outputfriendly subspaces, and a necessary and sufficient condition for the existence of the consistent output-friendly subspaces is obtained. Secondly, a type of state feedback controllers are designed to solve the Morgan＇s problem if it is solvable. By solving a set of matrix equations, a necessary and sufficient condition for converting an output-decomposed form to an input-output decomposed form is given, and by verifying the output controllability matrix, the solvability of Morgan＇s problem is obtained.

Observability of Periodically Switched Boolean Control Networks

In this paper,observability is studied for periodically switched Boolean control networks(PSBCNs),which are managed with periodic switching signal and consist of some Boolean control networks.Firstly,via semi-tensor product of matrices,PSBCNs are expressed as algebraic forms.Secondly,a parallel system is constructed by combining two same PSBCNs,based on which,the observability problem of the original PSBCN can be transformed into the set reachability problem of this parallel system.Then,two necessary and sufficient conditions are obtained to detect reachability of parallel systems and observability of PSBCNs.In addition,the proposed conditions are extended to the case of state constraints.Finally,a practical example and a numerical example are provided to illustrate the results.

Asurvey onob vabilit of Boolean control networks

Observability is a fundamental property of a partially observed dynamical system,which means whether one can use an input sequence and the corresponding output sequence to determine the initial state.Observability provides bases for many related problems,such as state estimation,identification,disturbance decoupling,controller synthesis,etc.Until now,fundamental improvement has been obtained in observability of Boolean control networks(BCNs)mainly based on two methods-Edward F.Moore's partition and our observability graph or their equivalent representations found later based on the semitensor product(STP)of matrices(where the STP was proposed by Daizhan Cheng),including necessary and sufficient conditions for different types of observability,extensions to probabilistic Boolean networks(PBNs)and singular BCNs,even to nondeterministic finite-transition systems(NFTSs);and the development(with the help of the STP of matrices)in related topics,such as com-putation of smallest invariant dual subspaces of BNs containing a set of Boolean functions,multiple-experiment observability verification/decomposition in BCNs,disturbance decoupling in BCNs,etc.This paper provides a thorough survey for these topics.The contents of the paper are guided by the above two methods.First,we show that Moore's partition-based method closely relates the following problems:computation of smallest invariant dual subspaces of BNs,multiple-experiment observ-ability verification/decomposition in BCNs,and disturbance decoupling in BCNs.However,this method does not apply to other types of observability or nondeterministic systems.Second,we show that based on our observability graph,four different types of observability have been verified in BCNs,verification results have also been extended to PBNs,singular BCNs,and NFTSs.In addition,Moore's partition also shows similarities between BCNs and linear time-invariant(LTI)control systems,e.g.,smallest invariant dual subspaces of BNs containing a set of Boolean functions in BCNs vs unobservable subspaces of LTI control systems,the forms of quotient systems based on observability decomposition in both types of systems.However,there are essential differences between the two types of systems,e.g.,"all plausible definitions of observability in LTI control systems turn out to be equivalent"(by Walter M.Wonham 1985),but there exist nonequivalent definitions of observability in BCNs;the quotient system based on observability decomposition always exists in an LTI control system,while a quotient system based on multiple-experiment observability decomposition does not always exist in a BCN.

Controllability of Boolean control networks with multiple time delays in both states and controls

In this paper,the problem of controllability of Boolean control networks(BCNs)with multiple time delays in both states and controls is investigated.First,the controllability problem of BCNs with multiple time delays in controls is considered.For this controllability problem,a controllability matrix is constructed by defining a new product of matrices,based on which a necessary and sufficient controllability condition is obtained.Then,the controllability of BCNs with multiple time delays in states is studied by giving a necessary and sufficient condition.Subsequently,based on these results,a controllability matrix for BCNs with multiple time delays in both states and controls is proposed that provides a concise controllability condition.Finally,two examples are given to illustrate the main results.

Switching-based stabilization of aperiodic sampled-data Boolean control networks with all subsystems unstable

We aim to further study the global stability of Boolean control networks(BCNs)under aperiodic sampleddata control(ASDC).According to our previous work,it is known that a BCN under ASDC can be transformed into a switched Boolean network(SBN),and further global stability of the BCN under ASDC can be obtained by studying the global stability of the transformed SBN.Unfortunately,since the major idea of our previous work is to use stable subsystems to offset the state divergence caused by unstable subsystems,the SBN considered has at least one stable subsystem.The central thought in this paper is that switching behavior also has good stabilization;i.e.,the SBN can also be stable with appropriate switching laws designed,even if all subsystems are unstable.This is completely different from that in our previous work.Specifically,for this case,the dwell time(DT)should be limited within a pair of upper and lower bounds.By means of the discretized Lyapunov function and DT,a sufficient condition for global stability is obtained.Finally,the above results are demonstrated by a biological example.

Cascading decomposition of Boolean control networks:a graph-theoretical method

Two types of cascading decomposition problems of Boolean control networks are investigated using a graph-theoretical method.A new graphic concept called nested perfect equal vertex partition(NPEVP)is proposed.Based on NPEVP,the necessary and sufficient graphic conditions for solvability of the cascading decomposition problems are obtained.Given the proposed graphic conditions,the logical coordinate transformations are constructively obtained to realize the corresponding cascading decomposition forms.Finally,two illustrative examples are provided to validate the results.

PID Pan-Boolean algebra control

Single input single output system was studied. With proportion, differential, integral results of deviation between given input and output as controller input, the logic rules in control process was analyzed, these logic rule with Pan-Boolean algebra was described, therefore a PID Pan-Boolean algebra control algorithm was obtained. The simulation results indicates that the new control algorithm is more effective compared to the traditional PID algorithm, having advantages such as more than 3 adjustable parameters of controllers, better result, and so on.

Control of random Boolean networks via average sensitivity of Boolean functions

In this paper, we discuss how to transform the disordered phase into an ordered phase in random Boolean networks. To increase the effectiveness, a control scheme is proposed, which periodically freezes a fraction of the network based on the average sensitivity of Boolean functions of the nodes. Theoretical analysis is carried out to estimate the expected critical value of the fraction, and shows that the critical value is reduced using this scheme compared to that of randomly freezing a fraction of the nodes. Finally, the simulation is given for illustrating the effectiveness of the proposed method.

Bisimulation-based stabilization of probabilistic Boolean control networks with state feedback control

This study is concerned with probabilistic Boolean control networks(PBCNs)with state feedback control.A novel definition of bisimilar PBCNs is proposed to lower computational complexity.To understand more on bisimulation relations between PBCNs,we resort to a powerful matrix manipulation called semi-tensor product(STP).Because stabilization of networks is of critical importance,the propagation of stabilization with probability one between bisimilar PBCNs is then considered and proved to be attainable.Additionally,the transient periods(the maximum number of steps to implement stabilization)of two PBCNs are certified to be identical if these two networks are paired with a bisimulation relation.The results are then extended to the probabilistic Boolean networks.

Attractor-Based Simultaneous Design of the Minimum Set of Control Nodes and Controllers in Boolean Networks

Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a controller is studied. A control node corresponds to a gene that expression can be controlled. Here, a Boolean network is used as a model of gene regulatory networks, and control specifications on attractors, which represent cell types or states of cells, are imposed. It is important to design a gene regulatory network that has desired attractors and has no undesired attractors. Using a matrix-based representation of BNs, this problem can be rewritten as an integer linear programming problem. Finally, the proposed method is demonstrated by a numerical example on a WNT5A network, which is related to melanoma.

The Nonlinear Filter Boolean Function of LILI-128 Stream Cipher Generator Is Successfully Broken Based on the Complexity of Nonlinear 0 1 Symbol Sequence

The nonlinear filter Boolean function of LILI-128 stream cipher generator is studied in this paper. First we measure the complexity of the stream ciphers sequence of LILI-128 stream cipher generator and obtain the shortest bit stream sequence reconstructed Boolean function of nonlinear filter in LILI-128 stream cipher generator. Then the least nonlinear Boolean function of generating stream cipher sequence is reconstructed by clusterig, nonlinear predictive and nonlinear synchronization from shortest bit stream sequence. We have verified the correctness of our reconstruction result by simulating the block diagram of Lili-128 keystream generator using our getting Boolean function and implement designers’ reference module of Lili-128 stream cipher public online, and two methods produce the same synchronous keystream sequence under same initial state, so that our research work proves that the nonlinear Boolean function of LILI-128 stream cipher generator is successfully broken.

Construction and Control of Genetic Regulatory Networks:A Multivariate Markov Chain Approach

In the post-genomic era, the construction and control of genetic regulatory networks using gene expression data is a hot research topic. Boolean networks (BNs) and its extension Probabilistic Boolean Networks (PBNs) have been served as an effective tool for this purpose. However, PBNs are difficult to be used in practice when the number of genes is large because of the huge computational cost. In this paper, we propose a simplified multivariate Markov model for approximating a PBN The new model can preserve the strength of PBNs, the ability to capture the inter-dependence of the genes in the network, qnd at the same time reduce the complexity of the network and therefore the computational cost. We then present an optimal control model with hard constraints for the purpose of control/intervention of a genetic regulatory network. Numerical experimental examples based on the yeast data are given to demonstrate the effectiveness of our proposed model and control policy.

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

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

九点控制器增益参数研究

研究了一种新型控制器——九点控制器增益的参数控制作用。九点控制器将偏差 -偏差变化率平面图划分为九个工况点 ,对象运行状态进入不同点时 ,随之产生不同的控制策略。这种控制器具有很强的控制对象适应性。通过分析系统的各项动、静态指标影响因素 ,给出相应改变九点控制器的控制策略——调整增益方向 ,由于分解了对性能指标之间相互影响 。

布尔控制网络的能控性与能观性(英文)

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

云服务平台多层网络协同控制模型

面向制造业产业链上中下游大规模多类型企业群,针对产业链协同云计算服务平台的访问控制问题,提出多类型协同的多层级体系控制机制。基于SaaS/PaaS的云服务模式,从云服务平台产业链的业务协作与访问控制协同出发,给出多层次、分体系的平台访问控制方案。利用各体系层次的关联关系,构建了多维关系布尔矩阵。利用语义关系将布尔关系矩阵转化为多层级体系复杂网络控制模型,并对网络模型进行了仿真实现,给出了模型的实际应用方案及效果。该网络模型改进了传统的基于角色的访问控制静态控制模式,且具有较好的稳定性与扩展性,为解决大规模企业群在角色层次授权多样化、权限体系动态变化过程中的云服务平台访问控制问题,提供了较好的理论支撑。