A note on observability of Boolean control networks

Serval existing definitions for observability of Boolean control networks (BCNs) are revisited and a new definition termed observability via output feedback is proposed. This definition restricts the input sequences used to distinguish distinct initial states to be generated by output feedbacks. A technique called parallel extension is proposed for observability analysis, the main idea of which is to interconnect a BCN with its duplication in parallel and transfer the observability problem of the original BCN to the set reachability problem of the interconnected BCN. Novel necessary and sufficient conditions for observability and observability under arbitrary inputs have been given, respectively. In addition, by restricting the output feedback to be static, a sufficient condition for observability via output feedback is proposed. An example is given to illustrate the main results.

We show some new results on the observability of Boolean control networks (BCNs). First, to study the observability, we combine two BCNs with the same transition matrix into a new BCN. Then, we propose the concept of a reachable set that results in a given set of initial states, and we derive four additional necessary and sufficient conditions for the observability of BCNs. In addition, we present an algoriTheoRemark and construct an observability graph to determine the observability of BCNs. Finally, we illustrate the obtained results using three numerical examples.

A note on observability of Boolean control networks

Input observability of Boolean control networks

Observability of Boolean networks via set controllability approach

The paper deals with problems on the stability and stabilization of Boolean networks with respect to a given part of variables characterizing the Boolean network. Using the semi-tensor product of matrices and the matrix expression of logic, the dynamics of a Boolean (control) network can be converted to discrete time linear (bilinear) dynamics called the algebraic form of the Boolean (control) network. The two main results are as follows: (i) From the algebraic form of a Boolean (control) network, two partial stability definitions are introduced. One is partial stability with respect to another variable set, and the other is partial stability with respect to arbitrary initial states. (ii) Based on the algebraic form, necessary and sufficient conditions for the stability of global partial states with respect to the variable set and arbitrary initial states are obtained. Examples are provided to illustrate the effectiveness of our results.

Nominal Boolean network is a kind of Boolean network, which is obtained from a Boolean control network with all controls disconnected. In this paper, the relationship between the transition matrix of the original Boolean control network and the transition matrix of the corresponding nominal Boolean control network is investigated. Due to the fact that transition matrices can be derived from structure matrices, the relationship between structure matrices of the original Boolean control network and structure matrices of the nominal Boolean network is studied. Via constant values corresponding to disconnected controls, structure matrices of the nominal Boolean network can be derived from structure matrices of the original Boolean control network. Finally, a concrete algorithm is presented to derive transition matrices of nominal Boolean networks.

This brief aims to investigate the structural observability of Boolean control networks, followed by the recent research stream, with available topology structure but unknown node dynamics. To begin with, two kinds of structural observability are defined along with two systems. Then, by adopting the dependency graphs, several necessary and sufficient conditions for structurally arbitrary-input and single-input observability are derived, respectively. Instead of employing the algebraic state space representation framework, this graphic-theoretical approach takes full advantage of node-to-node interaction, thus decreasing the time complexity to a great extent.

The stability of Boolean networks and the stabilization of Boolean control networks are investigated. Using semi-tensor product of matrices and the matrix expression of logic, the dynamics of a Boolean (control) network can be converted to a discrete time linear (bilinear) dynamics, called the algebraic form of the Boolean (control) network. They provide a framework for this study. Main results consist of two parts: (i) Using logic coordinate transformation, the known sufficient condition based on incidence matrix has been improved. It is also used in stabilizer design. (ii)Based on algebraic form, necessary and sufficient conditions for stability of Boolean networks and stabilization of Boolean control networks respectively are obtained.

Disturbance decoupling of Boolean networks via robust indistinguishability method

On the ensemble controllability of Boolean control networks using STP method

Controllability and observability of Boolean control networks subject to stuck-at fault

Minimum energy control and optimal-satisfactory control of Boolean control network

State feedback controller design for synchronization of master–slave Boolean networks based on core input-state cycles

The traditional set stability of Boolean networks (BNs) refers to whether all the states can converge to a given state subset. Different from the existing results, the set stability investigated in this paper is whether all states in a given initial set can converge to a given destination set. This paper studies the set stability and set stabilization avoiding undesirable sets of BNs and Boolean control networks (BCNs), respectively. First, by virtue of the semi-tensor product (STP) of matrices, the dynamics of BNs avoiding a given undesirable set are established. Then, the set reachability and set stability of BNs from the initial set to destination set avoiding an undesirable set are investigated, respectively. Furthermore, the set stabilization of BCNs from the initial set to destination set avoiding a given undesirable set are investigated. Finally, a design method for finding the time optimal set stabilizer is proposed, and an example is provided to illustrate the effectiveness of the results.