Synchronization Analysis of Master-Slave Probabilistic Boolean Networks

Stability and Stabilization in Probability of Probabilistic Boolean Networks

This article studies the stability in probability of probabilistic Boolean networks and stabilization in the probability of probabilistic Boolean control networks. To simulate more realistic cellular systems, the probability of stability/stabilization is not required to be a strict one. In this situation, the target state is indefinite to have a probability of transferring to itself. Thus, it is a challenging extension of the traditional probability-one problem, in which the self-transfer probability of the target state must be one. Some necessary and sufficient conditions are proposed via the semitensor product of matrices. Illustrative examples are also given to show the effectiveness of the derived results.

Asymptotical Feedback Set Stabilization of Probabilistic Boolean Control Networks

In this article, we investigate the asymptotical feedback set stabilization in distribution of probabilistic Boolean control networks (PBCNs). We prove that a PBCN is asymptotically feedback stabilizable to a given subset if and only if (iff) it constitutes asymptotically feedback stabilizable to the largest control-invariant subset (LCIS) contained in this subset. We proposed an algorithm to calculate the LCIS contained in any given subset with the necessary and sufficient condition for asymptotical set stabilizability in terms of obtaining the reachability matrix. In addition, we propose a method to design stabilizing feedback based on a state-space partition. Finally, the results were applied to solve asymptotical feedback output tracking and asymptotical feedback synchronization of PBCNs. Examples were detailed to demonstrate the feasibility of the proposed method and results.

Optimal State Estimation of Boolean Control Networks With Stochastic Disturbances

This paper presents an investigation of the optimal estimation of state for Boolean control networks subject to stochastic disturbances. The disturbances are modeled as independently and identically distributed processes that are assumed to be both mutually independent and independent of the current and the historical states. An iterative algorithm is proposed to calculate the conditional probability distribution of the state given the output measurements. This algorithm is applied to the problems of minimum mismatching estimation and maximum posterior estimation of the state. An example is provided to illustrate the proposed results.

Synchronization for the Realization-Dependent Probabilistic Boolean Networks

This paper investigates the synchronization problem for the realization-dependent probabilistic Boolean networks (PBNs) coupled unidirectionally in the drive-response configuration. The realization of the response PBN is assumed to be uniquely determined by the realization signal generated by the drive PBN at each discrete time instant. First, the drive-response PBNs are expressed in their algebraic forms based on the semitensor product method, and then, a necessary and sufficient condition is presented for the synchronization of the PBNs. Second, by resorting to a newly defined matrix operator, the reachable set from any initial state is expressed by a column vector. Consequently, an easily computable algebraic criterion is derived assuring the synchronization of the drive-response PBNs. Finally, three illustrative examples are employed to demonstrate the applicability and usefulness of the developed theoretical results.

Variable structure controller design for Boolean networks

The paper investigates the variable structure control for stabilization of Boolean networks (BNs). The design of variable structure control consists of two steps: determine a switching condition and determine a control law. We first provide a method to choose states from the reaching mode. Using this method, we can guarantee that the number of nodes which should be controlled is minimized. According to the selected states, we determine the switching condition to guarantee that the time of global stabilization in the BN is the shortest. A control law is then determined to ensure that all selected states can enter into the sliding mode, such that any initial state can arrive in the steady-state mode. Some examples are provided to illustrate the theoretical results.

Controllability and Synchronization Analysis of Identical-Hierarchy Mixed-Valued Logical Control Networks

This paper investigates the controllability and synchronization problems for identical-hierarchy mixed-valued logical control networks. The logical network considered is hierarchical, and Boolean network is a special case of logical network. Here, identical-hierarchy means that there are identical number of nodes in each layer of logical network and corresponding nodes have the same dimension for any two layers of logical networks. Meanwhile, in each layer of logical networks, the dimensions of nodes are distinct, and it is called a mixed-valued logical network. First, the controllability problem is investigated and two notions of controllability are presented, i.e., group-controllability and simultaneously-controllability. By resorting to Perron-Frobenius theorem, some necessary and sufficient criteria are obtained to guarantee group-controllability and simultaneously-controllability, respectively. Second, based on the algebraic representation of the studied model, synchronization problems are analytically discussed for two types of controls, i.e., free control sequences and state-output feedback control. Finally, two numerical examples are presented to show the validness of our main results.

Observability of Boolean multiplex control networks

Boolean multiplex (multilevel) networks (BMNs) are currently receiving considerable attention as theoretical arguments for modeling of biological systems and system level analysis. Studying control-related problems in BMNs may not only provide new views into the intrinsic control in complex biological systems, but also enable us to develop a method for manipulating biological systems using exogenous inputs. In this article, the observability of the Boolean multiplex control networks (BMCNs) are studied. First, the dynamical model and structure of BMCNs with control inputs and outputs are constructed. By using of Semi-Tensor Product (STP) approach, the logical dynamics of BMCNs is converted into an equivalent algebraic representation. Then, the observability of the BMCNs with two different kinds of control inputs is investigated by giving necessary and sufficient conditions. Finally, examples are given to illustrate the efficiency of the obtained theoretical results.

Partial Synchronization of Interconnected Boolean Networks

This paper addresses the partial synchronization problem for the interconnected Boolean networks (BNs) via the semi-tensor product (STP) of matrices. First, based on an algebraic state space representation of BNs, a necessary and sufficient criterion is presented to ensure the partial synchronization of the interconnected BNs. Second, by defining an induced digraph of the partial synchronized states set, an equivalent graphical description for the partial synchronization of the interconnected BNs is established. Consequently, the second partial synchronization criterion is derived in terms of adjacency matrix of the induced digraph. Finally, two examples (including an epigenetic model) are provided to illustrate the efficiency of the obtained results.

Sampled-Data State Feedback Stabilization of Boolean Control Networks

In this letter, we investigate the sampled-data state feedback control (SDSFC) problem of Boolean control networks (BCNs). Some necessary and sufficient conditions are obtained for the global stabilization of BCNs by SDSFC. Different from conventional state feedback controls, new phenomena observed the study of SDSFC. Based on the controllability matrix, we derive some necessary and sufficient conditions under which the trajectories of BCNs can be stabilized to a fixed point by piecewise constant control (PCC). It is proved that the global stabilization of BCNs under SDSFC is equivalent to that by PCC. Moreover, algorithms are given to construct the sampled-data state feedback controllers. Numerical examples are given to illustrate the efficiency of the obtained results.