This paper investigates the disturbance decoupling problem (DDP) of Boolean control networks (BCNs) by event-triggered control. Using the semi-tensor product of matrices, algebraic forms of BCNs can be achieved, based on which, event-triggered controllers are designed to solve the DDP of BCNs. In addition, the DDP of Boolean partial control networks is also derived by event-triggered control. Finally, two illustrative examples demonstrate the effectiveness of proposed methods.
22 September 2020 in IEEE Transactions on Automatic Control
For a Boolean network with disturbances and outputs, a necessary and sufficient graphic condition for the original disturbance decoupling is proposed, and it reveals that the outputs are unaffected by the disturbances if and only if the vertex-colored state transition graph has a concolorous perfect vertex partition (CP-VP). In addition, if the CP-VP is an equal partition, a corresponding system decomposition is implemented. Furthermore, an algorithm is designed to check the existence of a CP-VP.
1 March 2021 in IEEE Transactions on Neural Networks and Learning Systems
Analysis and design of steady states representing cell types, such as cell death or unregulated growth, are of significant interest in modeling genetic regulatory networks. In this article, the steady-state design of large-dimensional Boolean networks (BNs) is studied via model reduction and pinning control. Compared with existing literature, the pinning control design in this article is based on the original node's connection, but not on the state-transition matrix of BNs. Hence, the computational complexity is dramatically reduced in this article from O(2n x 2n) to O(2 x 2r), where n is the number of nodes in the large-dimensional BN and r< n is the largest number of in-neighbors of the reduced BN. Finally, the proposed method is well demonstrated by a T-LGL survival signaling network with 18 nodes and a model of survival signaling in large granular lymphocyte leukemia with 29 nodes. Just as shown in the simulations, the model reduction method reduces 99.98% redundant states for the network with 18 nodes, and 99.99% redundant states for the network with 29 nodes.
26 April 2019 in IEEE Transactions on Control of Network Systems
The outputs robustness is a property where the outputs of a system are insensitive to disturbances, and the property plays an important role in biological systems or engineering design. This paper presents an approach to analyze the outputs robustness with respect to disturbances (w.r.t. disturbances) for Boolean control networks (BCNs). Based on the wiring digraph of a BCN rather than the state transition digraph, an algorithm is proposed to construct a corresponding permutation digraph and permutation system. Then, we prove that if there exists a pinning controller such that the outputs of a permutation system are robust w.r.t. disturbances, then there must also exist another pinning controller such that the outputs of the corresponding original systems achieve robustness. Furthermore, pinning controllers are designed based on the neighbors of the pinned-nodes rather than all of the nodes. Finally, the proposed method is well demonstrated by a reduced signal transduction network.
2 December 2024 in IEEE Transactions on Control of Network Systems
In this paper, the output regulation problem (ORP) of Boolean control networks (BCNs) is studied via the semi-tensor product of matrices, with consideration of probabilistic outputs from the reference Boolean networks (BNs). We first define the concept of mean square error (MSE) between outputs of two BNs, establishing several theoretical results on the solvability of the ORP. Subsequently, state feedback controllers are designed to address the ORP of BCNs under different scenarios. In the first scenario, ORP is addressed by developing control strategies that ensure the system's output remains within a predefined MSE threshold; in the second scenario, we focus on achieving the minimum MSE through the optimization of control strategies; and the final scenario extends the second by conducting a detailed analysis to maintain this minimum MSE uniformly across all state pairs. To conclude, several numerical examples are provided to verify the effectiveness of the proposed theoretical results.
5 December 2018 in IEEE Transactions on Neural Networks and Learning Systems
In real systems, most of the biological functionalities come from the fact that the connections are not active all the time. Based on the fact, temporal Boolean networks (TBNs) are proposed in this paper, and the fast-time stability is analyzed via semi-tensor product (STP) of matrices and incidence matrices. First, the algebraic form of a TBN is obtained based on the STP method, and one necessary and sufficient condition for global fast-time stability is presented. Moreover, incidence matrices are used to obtain several sufficient conditions, which reduce the computational complexity from O(n2ⁿ) (exponential type) to O(n⁴) (polynomial type) compared with the STP method. In addition, the global fast-time stabilization of TBNs is considered, and pinning controllers are designed based on the neighbors of controlled nodes rather than all the nodes. Finally, the local fast-time stability of TBNs is considered based on the incidence matrices as well. Several examples are provided to illustrate the effectiveness of the obtained results.