Robust stability in distribution of Boolean networks under multi-bits stochastic function perturbations

In this work, robust stability in distribution of Boolean networks (BNs) is studied under multi-bits probabilistic and markovian function perturbations. Firstly, definition of multi-bits stochastic function perturbations is given and an identification matrix is introduced to present each case. Then, by viewing each case as a switching subsystem, BNs under multi-bits stochastic function perturbations can be equivalently converted into stochastic switching systems. After constructing respective transition probability matrices which can unify multi-bits probabilistic and markovian function perturbations in a consolidated framework, robust stability in distribution can be handled. On such basis, necessary and sufficient conditions for robust stability in distribution of BNs under stochastic function perturbations are given respectively. Finally, two numerical examples are presented to verify the validity of our theoretical results.     

Output tracking of switched Boolean networks under open-loop/closed-loop switching signals

This paper addresses the output tracking problem of switched Boolean networks (SBNs) via the semi-tensor product method, and presents a number of new results. Firstly, the concept of switching-output-reachability is proposed for SBNs, based on which, a necessary and sufficient condition is presented for the output tracking of SBNs under arbitrary open-loop switching signal. Secondly, a constructive procedure is proposed for the design of closed-loop switching signals for SBNs to track a constant reference signal. The study of an illustrative example shows that the obtained new results are very effective.     

Finite-time stability of hybrid systems with continuous and Boolean dynamics

The hybrid systems with continuous and discrete variables can be used to describe many real-world phenomena. In this paper, by generalizing the mathematical form of gene regulatory networks, a novel class of hybrid systems consisting of continuous and Boolean dynamics is investigated. Firstly, the new hybrid system is introduced in detail, and a concept of finite-time stability (FTS) for it is proposed. Next, the existence and uniqueness of solutions are proved by fixed point theory. Furthermore, based on Lyapunov functions and the semi-tensor product (STP), i.e., Cheng product, some sufficient conditions of FTS for the hybrid systems are presented. The main results are illustrated by two numerical examples.     

Set stabilizability of switched Boolean control networks via Ledley antecedence solution

This paper studies two kinds of set stabilizability issues of switched Boolean control networks (SBCNs) by Ledley antecedence solution, that is, pointwise set stabilizability and set stabilizability under arbitrary switching signals. Firstly, based on the state transition matrix of SBCNs, the mode-dependent truth matrix is defined. Secondly, using the mode-dependent truth matrix in every step, a switching signal and the corresponding Ledley antecedence solutions are determined. Furthermore, a state feedback switching signal and a state feedback control are obtained for the pointwise set stabilizability. Thirdly, with the help of all mode-dependent truth matrices, the Ledley antecedence solutions are derived for a set of Boolean inclusions, which admits a state feedback control for the set stabilizability under arbitrary switching signals. Finally, an example is given to show the effectiveness of the proposed results.     

Stability analysis of activation-inhibition Boolean networks with stochastic function structures

This paper analyzes the stability of activation-inhibition Boolean networks with stochastic function structures. First, the activation-inhibition Boolean networks with stochastic function structures are converted to the form of logical networks by the method of semitensor product of matrices. Second, based on the obtained algebraic forms, we use matrices to denote the index set of possible logical operators and transition probabilities for activation-inhibition Boolean networks. Third, equivalence criterions are presented for the stabilities analysis of activation-inhibition Boolean networks with stochastic function structures. Finally, an example is given to verify the validity of the results.     

Stabilization and set stabilization of switched Boolean control networks via flipping mechanism

Stabilization and set stabilization of switched Boolean control networks are investigated by using flipping mechanism in this paper. Firstly, with the help of Warshall algorithm, an explicit criterion for the stabilization of switched Boolean control networks is derived. Secondly, the necessary and sufficient condition for the solvability of stabilization of switched Boolean control networks, by flipping some elements of perturbation set once, is presented. Thirdly, a search algorithm is proposed to calculate the minimum number of stabilization flipped nodes and what exactly they are. Furthermore, a necessary and sufficient condition is established for the solvability of set stabilization of switched Boolean control networks by flipping some elements of perturbation set once. Analogously, an algorithm is given to find the minimum number of set stabilization flipped nodes. Finally, examples are shown to demonstrate the feasibility of the above results.     

On stability of switched homogeneous nonlinear systems

In this paper, the problem of stability of switched homogeneous systems is addressed. First of all, if there is a quadratic Lyapunov function such that nonlinear homogeneous systems are asymptotically stable, a matrix Lyapunov-like equation is obtained for a stable nonlinear homogeneous system using semi-tensor product of matrices, and Lyapunov equation of linear system is just its particular case. Following the previous results, a sufficient condition is obtained for stability of switched nonlinear homogeneous systems, and a switching law is designed by partition of state space. In particular, a constructive approach is provided to avoid chattering phenomena which is caused by the switching rule. Then for planar switched homogeneous systems, an LMI approach to stability of planar switched homogeneous systems is presented. Similar to the condition for linear systems, the LMI-type condition is easily verifiable. An example is given to illustrate that candidate common Lyapunov function is a key point for design of switching law.     

Structural stability analysis of gene regulatory networks modeled by Boolean networks

This paper studies the structural monostability and structural cycle‐stability of Boolean networks (BNs). Firstly, the structural‐equivalent Boolean networks are converted to the algebraic forms by using the semitensor product of matrices. Secondly, the concepts of structural monostability and structural cycle‐stability for Boolean networks are proposed. On the basis of the algebraic forms of structural‐equivalent Boolean networks, some necessary and sufficient conditions are presented for the structural monostability and structural cycle‐stability of Boolean networks. Finally, an illustrative example is worked out to show the effectiveness of the obtained results.     

Controllability and stabilization of periodic switched Boolean control networks with application to asynchronous updating

This paper investigates the periodic switching point controllability and stabilization of periodic switched Boolean control networks (PSBCNs), and applies the obtained results to the stabilization of deterministic asynchronous Boolean control networks (DABCNs). Firstly, using the algebraic state space representation of PSBCNs, a kind of periodic switching point controllability matrix is constructed, based on which, a necessary and sufficient condition is presented for the periodic switching point reachability and controllability of PSBCNs. Secondly, using the reachable set of PSBCNs, a constructive procedure is proposed to design time-variant state feedback controllers for the periodic switching point stabilization of PSBCNs. Finally, by converting the dynamics of DABCNs into the form of PSBCNs, the time-variant state feedback stabilization problem of DABCNs is solved.     

Formulation and optimization control of a class of networked evolutionary games with switched topologies

This paper studies the algebraic formulation and optimization control for a class of networked evolutionary games with switched topologies via the semi-tensor product method. First, an algebraic expression is formulated for the given networked evolutionary games, based on which, the behavior of corresponding evolutionary games is analyzed. Then, under some certain assumptions, the existence of fixed points for the given systems is proved and a free-type control sequence is designed to guarantee the best strategy profile reachable globally. Finally, an illustrative example is studied to support our new results.     

Global convergence of serial Boolean networks based on algebraic representation

This paper analyzes the global convergence of serial Boolean networks (SBNs) via the semi-tensor product of matrices, and presents some new results. Firstly, an algebraic representation is obtained for SBNs, and an algorithm is established for the conversion between the algebraic representations of SBNs and the corresponding Boolean networks. Secondly, the non-equivalence of global convergence between SBNs and the corresponding Boolean networks is revealed, although they have the same fixed points. Thirdly, a necessary and sufficient condition is presented for the global convergence of SBNs. Finally, the obtained results are applied to the evolutionary behaviour analysis of evolutionary networked games with cascading myopic best response adjustment.     

Exponential stability of simultaneously triangularizable switched systems with explicit calculation of a common Lyapunov function

In this note, a common quadratic Lyapunov function is explicitly calculated for a linear hybrid system described by a family of simultaneously triangularizable matrices. The explicit construction of such a function allows not only obtaining an estimate of the convergence rate of the exponential stability of the switched system under arbitrary switching but also calculating an upper bound for the output during its transient response. Furthermore, the presented result is then extended to the case where the system is affected by parametric uncertainty, providing the corresponding results in terms of the nominal matrices and uncertainty bounds.     

On computation of the steady-state probability distribution of probabilistic Boolean networks with gene perturbation

Given a Probabilistic Boolean Network (PBN), an important problem is to study its steady-state probability distribution for network analysis. In this paper, we present a new perturbation bound of the steady-state probability distribution of PBNs with gene perturbation. The main contribution of our results is that this new bound is established without additional condition required by the existing method. The other contribution of this paper is to propose a fast algorithm based on the special structure of a transition probability matrix of PBNs with gene perturbation to compute its steady-state probability distribution. Experimental results are given to demonstrate the effectiveness of the new bound, and the efficiency of the proposed method.     

Identification of predictors of Boolean networks from observed attractor states

Predictors of Boolean networks are of significance for biologists to target their research on gene regulation and control. This paper aims to investigate how to determine predictors of Boolean networks from observed attractor states by solving logical equations. The proposed method consists of four steps. First, all possible cycles formed by known attractor states are constructed. Then, for each possible cycle, all data‐permitted predictors of each node are identified according to the known attractor states. Subsequently, the data‐permitted predictors are incorporated with some common biological constraints to generate logical equations that describe whether such possible predictors can ultimately be chosen as valid ones by the biological constraints. Finally, solve the logical equations; the solutions determine a family of predictors satisfying the known attractor states. The approach is quite different from others such as computer algorithm‐based and provides a new angle and means to understand and analyze the structures of Boolean networks.     

Output tracking control of Boolean control networks with impulsive effects

This paper studies the output tracking problem of Boolean control networks (BCNs) with impulsive effects via the algebraic state‐space representation approach. The dynamics of BCNs with impulsive effects is converted to an algebraic form. Based on the algebraic form, some necessary and sufficient conditions are presented for the feedback output tracking control of BCNs with impulsive effects. These conditions contain constant reference signal case and time‐varying reference signal case. The study of an illustrative example shows that the obtained new results are effective.     

一类不确定线性切换系统二次鲁棒稳定性的充分条件

本文研究了一类不确定线性切换系统的二次鲁棒稳定性问题.首先利用矩阵集的严格完备性设计切换律,导出了二次鲁棒稳定的充分条件.同时得到了在任意切换策略下,当矩阵集的所有矩阵为负定时保证切换系统二次鲁棒稳定性.在适当的假设下,这些条件可以表示为矩阵不等式.最后,用数值例子对所得结果加以阐明,说明了文中结果的正确性.     

Robust reliable stabilization of uncertain switched neutral systems with delayed switching

This paper investigates the problem of robust reliable control for a class of uncertain switched neutral systems under asynchronous switching, where the switching instants of the controller experience delays with respect to those of the system and the parameter uncertainties are assumed to be norm-bounded. A state feedback controller is proposed to guarantee exponential stability and reliability for switched neutral systems, and the dwell time approach is utilized for the stability analysis and controller design. A numerical example is given to illustrate the effectiveness of the proposed method.     

Robust exponential stability of impulsive switched systems with switching delays: A Razumikhin approach

In this paper, we focus on the robust exponential stability of a class of uncertain nonlinear impulsive switched systems with switching delays. We introduce a novel type of piecewise Lyapunov-Razumikhin functions. Such functions can efficiently eliminate the impulsive and switching jump of adjacent Lyapunov functions at impulsive switching instants. By Razumikhin technique, the delay-independent criteria of exponential stability are established on the minimum dwell time. Finally, an illustrative numerical example is presented to show the effectiveness of the obtained theoretical results.     

Robust stability analysis of uncertain systems with two additive time-varying delay components

This paper is concerned with stability analysis for uncertain systems. The systems are based on a new time-delay model proposed recently, which contains multiple successive delay components in the state. The relationship between the time-varying delay and its upper bound is taken into account when estimating the upper bound of the derivative of Lyapunov functional. As a result, some less conservative stability criteria are established for systems with two successive delay components and parameter uncertainties. Numerical examples show that the proposed criteria are effective and are an improvement over some existing results in the literature.     

基于LMIs的一类不确定线性切换系统的鲁棒控制

基于LMIs处理方法,研究了一类不确定线性切换系统在任意切换下的鲁棒控制问题.利用矩阵Schur补引理构造线性矩阵不等式,得到该系统的鲁棒稳定性的充要条件,同时也给出了在状态反馈下的鲁棒稳定性充要条件和在输出反馈下的充分条件.最后用数值例子对所得结果加以验证,说明了文中结果的正确性.