Shiyong Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shiyong Zhu has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Jianquan Lu
Southeast University
17 shared publications - Jinde Cao
School of Mathematics, Southeast University, Nanjing 210096, People’s Republic of China
11 shared publications - Lin Lin
Department of Mechanical Engineering, The University of Hong Kong, Hong Kong
8 shared publications - Yang Liu
School of Mathematical Sciences, Zhejiang Normal University, Jinhua, China
8 shared publications - Leszek Rutkowski
Polish Academy of Sciences
4 shared publications - Shun-Ichi Azuma
Kyoto University
4 shared publications
Latest Publications
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (9) , 5743-5758
A Bisimulation-Based Foundation for Scale Reductions of Continuous-Time Markov Chains
In this paper, the scale reduction problem of continuous-time Markov chains (CT-MCs) and continuous-time controlled Markov chains (CT-CMCs) are disserted both from the bisimulation perspective. Based on the features of bisimulation, the reachability, macro-controllability, controllability, and stabilizability of CT-MCs and CT-CMCs, particularly, the large-scale ones, are addressed over the corresponding reduced chains. The bisimulation relations are defined for both CT-MCs and CT-CMCs to establish the equivalence between the original networks and their condensed networks. A computable algorithm is developed to compute the reachability-based maximal bisimulation relation for CMCs, resulting in the smallest bisimulating CMCs. Notably, one advantage of our techniques lies in their efficiency in implementing the existing analysis and control results on MCs and CMCs in a lower amount of time, with wide applications to logical networks, finite-field networks, finite automata, and Petri nets. Compared to their discrete-time counterparts, CT-MCs and CT-CMCs inherit a simplified essential network topology in the discrete-time structures while providing a quantitative description of transient functional kinetics on the micro-time scale level. Besides, all the developed theoretical results for CT-MCs and CT-CMCs are operated based on the transition rate matrices of chains rather than transition probability matrices used in the traditional methods. Finally, the derived theoretical results are validated by investigating the p53-Mdm2 signaling network and a relevant case-study involving a set of randomly generated CT-CMCs.
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (9) , 5743-5758
A Bisimulation-Based Foundation for Scale Reductions of Continuous-Time Markov Chains
In this paper, the scale reduction problem of continuous-time Markov chains (CT-MCs) and continuous-time controlled Markov chains (CT-CMCs) are disserted both from the bisimulation perspective. Based on the features of bisimulation, the reachability, macro-controllability, controllability, and stabilizability of CT-MCs and CT-CMCs, particularly, the large-scale ones, are addressed over the corresponding reduced chains. The bisimulation relations are defined for both CT-MCs and CT-CMCs to establish the equivalence between the original networks and their condensed networks. A computable algorithm is developed to compute the reachability-based maximal bisimulation relation for CMCs, resulting in the smallest bisimulating CMCs. Notably, one advantage of our techniques lies in their efficiency in implementing the existing analysis and control results on MCs and CMCs in a lower amount of time, with wide applications to logical networks, finite-field networks, finite automata, and Petri nets. Compared to their discrete-time counterparts, CT-MCs and CT-CMCs inherit a simplified essential network topology in the discrete-time structures while providing a quantitative description of transient functional kinetics on the micro-time scale level. Besides, all the developed theoretical results for CT-MCs and CT-CMCs are operated based on the transition rate matrices of chains rather than transition probability matrices used in the traditional methods. Finally, the derived theoretical results are validated by investigating the p53-Mdm2 signaling network and a relevant case-study involving a set of randomly generated CT-CMCs.
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (7) , 4718-4725
Leader–Follower Consensus Over Finite Fields
In this paper, we investigate the leader-follower consensus of multi-agent systems over finite fields, which model agents with limited capacities for storing, processing, and transmitting the information, from the perspectives of the transition graph and the characteristic polynomial of the network matrix, respectively. By the features of dynamics over finite fields, we reveal that the transition graph of networks achieving the leader-follower consensus over finite fields is either a spanning in-tree topped at zero-state or is composed of spanning in-trees with the same structure, topped at steady states. To address the high time complexity associated with transition graphs and existing methods, we integrate the characteristic polynomial of the network matrix with the cycle and tree structures in the transition graph. As a result, a concise criterion is established only based on the characteristic polynomial, which merely requires polynomial computational complexity with respect to the number of network nodes. Finally, a numerical example is presented to validate the effectiveness of the obtained theoretical results.
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (7) , 4718-4725
Leader–Follower Consensus Over Finite Fields
In this paper, we investigate the leader-follower consensus of multi-agent systems over finite fields, which model agents with limited capacities for storing, processing, and transmitting the information, from the perspectives of the transition graph and the characteristic polynomial of the network matrix, respectively. By the features of dynamics over finite fields, we reveal that the transition graph of networks achieving the leader-follower consensus over finite fields is either a spanning in-tree topped at zero-state or is composed of spanning in-trees with the same structure, topped at steady states. To address the high time complexity associated with transition graphs and existing methods, we integrate the characteristic polynomial of the network matrix with the cycle and tree structures in the transition graph. As a result, a concise criterion is established only based on the characteristic polynomial, which merely requires polynomial computational complexity with respect to the number of network nodes. Finally, a numerical example is presented to validate the effectiveness of the obtained theoretical results.
- Top Cited Papers
- 6 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (4) , 2158-2173
Minimal Control Nodes for Strong Structural Observability of Discrete-Time Iterative Systems: Explicit Formulas and Polynomial-Time Algorithms
In this paper, we initiate an important class of vertex-marked directed graphs, referred to as the strong structurally observable graphs (SSOGs), which are the fundamental network-structural architectures guaranteeing the observability of several prevalent types of discrete-time iteration systems. This paper also answers the minimal control node problem, a longstanding matter of the art in complex networks and engineering systems, for SSOGs by deriving two explicit formulas and the corresponding polynomial-time algorithms. Initially, by exploring the strong structural observability of Boolean networks, an underlying class of SSOGs is proposed as an extended counterpart of network structures of observable conjunctive Boolean networks, where we call for particular attention to the circumstances where the available network structure and unknown node dynamics. With such a class of SSOGs, we proceed to justify that they can address a general class of discrete-time iteration systems. In our formulation, the robustness against the uncertainties in nodal dynamics is achieved by merely making use of the information on network structures. Two minimal synthesis strategies are, respectively, established to render a directed graph strongly structurally observable in polynomial time by placing a minimal number of sensors or controlling the nodes while avoiding exhaustive brute-force searches. Notably, apart from explicitly calculating the minimal set of controlled nodes, the structural insights are also leveraged to account for the close relations between the observability of considered iteration systems and observed-path-compatible paths/cycles. For certain special yet worthy cases, the SSOGs are specialized in the strong structural observability of finite-field networks and derive the minimum pinned node theorem of Boolean networks with a biological case study as an efficient demonstration.
- 6 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (4) , 2158-2173
Top Cited PapersMinimal Control Nodes for Strong Structural Observability of Discrete-Time Iterative Systems: Explicit Formulas and Polynomial-Time Algorithms
In this paper, we initiate an important class of vertex-marked directed graphs, referred to as the strong structurally observable graphs (SSOGs), which are the fundamental network-structural architectures guaranteeing the observability of several prevalent types of discrete-time iteration systems. This paper also answers the minimal control node problem, a longstanding matter of the art in complex networks and engineering systems, for SSOGs by deriving two explicit formulas and the corresponding polynomial-time algorithms. Initially, by exploring the strong structural observability of Boolean networks, an underlying class of SSOGs is proposed as an extended counterpart of network structures of observable conjunctive Boolean networks, where we call for particular attention to the circumstances where the available network structure and unknown node dynamics. With such a class of SSOGs, we proceed to justify that they can address a general class of discrete-time iteration systems. In our formulation, the robustness against the uncertainties in nodal dynamics is achieved by merely making use of the information on network structures. Two minimal synthesis strategies are, respectively, established to render a directed graph strongly structurally observable in polynomial time by placing a minimal number of sensors or controlling the nodes while avoiding exhaustive brute-force searches. Notably, apart from explicitly calculating the minimal set of controlled nodes, the structural insights are also leveraged to account for the close relations between the observability of considered iteration systems and observed-path-compatible paths/cycles. For certain special yet worthy cases, the SSOGs are specialized in the strong structural observability of finite-field networks and derive the minimum pinned node theorem of Boolean networks with a biological case study as an efficient demonstration.
- 28 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 70 (12) , 5456-5467
On Synchronization Design and State Observer Design of (Singular) Boolean Networks
This paper first investigates the synchronization design problem for both Boolean networks (BNs) and singular BNs. According to the complete family of reachable sets, all possible synchronized response BNs and all possible weakly synchronized response singular BNs can be constructed. Subsequently, it is noted that there is similarity between synchronized response (singular) BNs and state observers. The synchronized response (singular) BN is constructed based on the state of a given drive (singular) BN, making its state gradually tend to be consistent with the state of the given drive (singular) BN. While the state observer is designed based on the output of a given real (singular) BN, making its state (state estimation) gradually tend to be consistent with the state of the given real (singular) BN. Therefore, consider applying the results for constructing synchronized response (singular) BNs to designing state observers for (singular) BNs. Specifically, the real (singular) BN to be observed can be regarded as a drive (singular) BN. Consequently, the problem for designing state observers can be transformed into the problem for constructing response (singular) BNs that achieve synchronization with a given real (singular) BN, and then the gain matrix of the designed state observer can be obtained by solving a matrix equation. The method for designing state observers is superior to other methods in that the accurate estimated time for designed state observers can be determined and adjusted to some certain extent, and all possible state observers in the considered form can be designed.
- 28 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 70 (12) , 5456-5467
On Synchronization Design and State Observer Design of (Singular) Boolean Networks
This paper first investigates the synchronization design problem for both Boolean networks (BNs) and singular BNs. According to the complete family of reachable sets, all possible synchronized response BNs and all possible weakly synchronized response singular BNs can be constructed. Subsequently, it is noted that there is similarity between synchronized response (singular) BNs and state observers. The synchronized response (singular) BN is constructed based on the state of a given drive (singular) BN, making its state gradually tend to be consistent with the state of the given drive (singular) BN. While the state observer is designed based on the output of a given real (singular) BN, making its state (state estimation) gradually tend to be consistent with the state of the given real (singular) BN. Therefore, consider applying the results for constructing synchronized response (singular) BNs to designing state observers for (singular) BNs. Specifically, the real (singular) BN to be observed can be regarded as a drive (singular) BN. Consequently, the problem for designing state observers can be transformed into the problem for constructing response (singular) BNs that achieve synchronization with a given real (singular) BN, and then the gain matrix of the designed state observer can be obtained by solving a matrix equation. The method for designing state observers is superior to other methods in that the accurate estimated time for designed state observers can be determined and adjusted to some certain extent, and all possible state observers in the considered form can be designed.
- 15 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (4) , 2422-2428
Lyapunov-Type Criteria of Absorbing Continuous-Time Markov Chains
A Lyapunov stability theory is developed for absorbing continuous-time Markov chains (CT-MCs) in this technical note. The derived Lyapunov criteria are all necessary and sufficient for absorbing CT-MCs and set absorbing CT-MCs, where Lyapunov functions can be constructed in a polynomial amount of time with respect to the cardinality of state spaces. Furthermore, the gap between Lyapunov functions of the CT-MCs and of the discrete-time Markov chains (DT-MCs) is bridged by demonstrating the feature that the length of the sampling period in the sampled-data CT-MCs does not affect the stabilizability. The results presented here provide a novel tool for efficient analysis and synthesis of large-scale CT-MCs in the same manner as in dynamic systems. The applicability of these novel theoretical results is demonstrated via practical bio-inspired networks from the literature.
- 15 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (4) , 2422-2428
Lyapunov-Type Criteria of Absorbing Continuous-Time Markov Chains
A Lyapunov stability theory is developed for absorbing continuous-time Markov chains (CT-MCs) in this technical note. The derived Lyapunov criteria are all necessary and sufficient for absorbing CT-MCs and set absorbing CT-MCs, where Lyapunov functions can be constructed in a polynomial amount of time with respect to the cardinality of state spaces. Furthermore, the gap between Lyapunov functions of the CT-MCs and of the discrete-time Markov chains (DT-MCs) is bridged by demonstrating the feature that the length of the sampling period in the sampled-data CT-MCs does not affect the stabilizability. The results presented here provide a novel tool for efficient analysis and synthesis of large-scale CT-MCs in the same manner as in dynamic systems. The applicability of these novel theoretical results is demonstrated via practical bio-inspired networks from the literature.
- 22 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (12) , 7299-7311
Observability and Detectability of Stochastic Labeled Graphs
In this paper, observable stochastic graphs and detetectable stochastic graphs are, respectively, defined with the detailed implementation for the observability and detectability of stochastic discrete-time and discrete-state dynamic systems. More specifically, they are generally two classes of vertex-colored and edge-labeled graphs rendering a walking agent therein to determine his initial and current positions, respectively, in probability one by measuring the color sequence of his traversed vertices. In the part of analysis, we follow the aforementioned two definitions and establish the corresponding polynomial-time verifying algorithms. Notably, the implicit formulas are also established to calculate the observability and detectability probability for any pairwise vertex pair. In the synthesis part, the minimal number of colors dyeing the vertices to make any considered graph stochastically observable and detectable is investigated, respectively. Our results indicate that the minimal coloring problem is NP-hard for observability in the stochastic situations but is solvable in polynomial time for detectability in the deterministic cases. The observability and detectability of stochastic finite-valued systems, assembling with the finite-cardinal state spaces, are validated as a compelling application of these two types of directed graphs, whereas the minimal sensors placement problems subject to observability and detectability problems are accordingly interpreted by the minimum set cover algorithm.
- 22 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (12) , 7299-7311
Observability and Detectability of Stochastic Labeled Graphs
In this paper, observable stochastic graphs and detetectable stochastic graphs are, respectively, defined with the detailed implementation for the observability and detectability of stochastic discrete-time and discrete-state dynamic systems. More specifically, they are generally two classes of vertex-colored and edge-labeled graphs rendering a walking agent therein to determine his initial and current positions, respectively, in probability one by measuring the color sequence of his traversed vertices. In the part of analysis, we follow the aforementioned two definitions and establish the corresponding polynomial-time verifying algorithms. Notably, the implicit formulas are also established to calculate the observability and detectability probability for any pairwise vertex pair. In the synthesis part, the minimal number of colors dyeing the vertices to make any considered graph stochastically observable and detectable is investigated, respectively. Our results indicate that the minimal coloring problem is NP-hard for observability in the stochastic situations but is solvable in polynomial time for detectability in the deterministic cases. The observability and detectability of stochastic finite-valued systems, assembling with the finite-cardinal state spaces, are validated as a compelling application of these two types of directed graphs, whereas the minimal sensors placement problems subject to observability and detectability problems are accordingly interpreted by the minimum set cover algorithm.
- Top Cited Papers
- 21 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (1) , 174-188
Toward Stabilizable Large-Scale Boolean Networks by Controlling the Minimal Set of Nodes
This paper studies structural controllers and distributed pinning controllers for the global stabilization of Boolean networks (BNs) by integrating the information on their network structures with nodal dynamics. The main contribution is that several computationally efficient procedures are presented to reduce the number of controlled nodes and to determine a minimal set of controlled nodes without using the brute-force searches. The primary objective is to identify a minimal set of nodes that need to be controlled in the structural controllers for the strong structural stabilization of BNs when network structures is available yet nodal dynamics are unknown. To this end, a theorem shows this minimum controlled node problem can be addressed by seeking the minimum feedback vertex set of network structure. The subsequent part concentrates on designing distributed pinning controllers that merely rely on the node-to-node information exchanges for the global stabilization of BNs with the full knowledge of the nodal dynamics. Several sufficient conditions are provided by utilizing the irreducibility and activation-inhibition network structures to reduce the conservatism. Notably, we claim that, for regulatory BNs without positive cycles, the minimal set of pinned nodes can be determined with a linear amount of time subject to the total number of logical operators in the nodal dynamics. Finally, the effectiveness of these results are validated by three case studies.
- 21 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (1) , 174-188
Top Cited PapersToward Stabilizable Large-Scale Boolean Networks by Controlling the Minimal Set of Nodes
This paper studies structural controllers and distributed pinning controllers for the global stabilization of Boolean networks (BNs) by integrating the information on their network structures with nodal dynamics. The main contribution is that several computationally efficient procedures are presented to reduce the number of controlled nodes and to determine a minimal set of controlled nodes without using the brute-force searches. The primary objective is to identify a minimal set of nodes that need to be controlled in the structural controllers for the strong structural stabilization of BNs when network structures is available yet nodal dynamics are unknown. To this end, a theorem shows this minimum controlled node problem can be addressed by seeking the minimum feedback vertex set of network structure. The subsequent part concentrates on designing distributed pinning controllers that merely rely on the node-to-node information exchanges for the global stabilization of BNs with the full knowledge of the nodal dynamics. Several sufficient conditions are provided by utilizing the irreducibility and activation-inhibition network structures to reduce the conservatism. Notably, we claim that, for regulatory BNs without positive cycles, the minimal set of pinned nodes can be determined with a linear amount of time subject to the total number of logical operators in the nodal dynamics. Finally, the effectiveness of these results are validated by three case studies.
- Top Cited Papers
- 5 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (9) , 5461-5476
Strong Structural Controllability of Boolean Networks: Polynomial-Time Criteria, Minimal Node Control, and Distributed Pinning Strategies
In this article, we initiate the strong structural controllability of Boolean networks (BNs), in order to cope with the difficulty of identifying intricate nodal dynamics. The derived necessary and sufficient criteria for the strong structural controllability of BNs are checkable in a polynomial amount of time. As an interesting feature, controllability is shown to be equivalent to fixed-time controllability in the network-structure regard. We further explore the minimal strong structural controllability problem of BNs that, reduced from the minimum vertex cover problem of graphs, consequently turns out to be NP-hard. More worthy implications are that our results on the strong structural controllability also serve as the basis to improve several existing approaches to a certain extent. First, the network aggregation subject to the controllability of BNs is provided where the aggregated blocks, except the rooted blocks, are strongly structurally controllable. Second, the pinning controllers are carried out to render an arbitrary BN controllable through node-to-node message exchange in a distributed form while traditional results only check the controllability of BNs with the preassigned controllers. Notably, the time complexity to design such controllers reduces to be only exponential with the maximal in-degree of pinned nodes rather than the node number of networks. As for the stochastic counterpart, upon the equivalence between the asymptotic stability of stochastic BNs and the criteria of strong structural controllability, we also further facilitate the design of distributed controllers to asymptotically stabilize stochastic BNs in probability.
- 5 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (9) , 5461-5476
Top Cited PapersStrong Structural Controllability of Boolean Networks: Polynomial-Time Criteria, Minimal Node Control, and Distributed Pinning Strategies
In this article, we initiate the strong structural controllability of Boolean networks (BNs), in order to cope with the difficulty of identifying intricate nodal dynamics. The derived necessary and sufficient criteria for the strong structural controllability of BNs are checkable in a polynomial amount of time. As an interesting feature, controllability is shown to be equivalent to fixed-time controllability in the network-structure regard. We further explore the minimal strong structural controllability problem of BNs that, reduced from the minimum vertex cover problem of graphs, consequently turns out to be NP-hard. More worthy implications are that our results on the strong structural controllability also serve as the basis to improve several existing approaches to a certain extent. First, the network aggregation subject to the controllability of BNs is provided where the aggregated blocks, except the rooted blocks, are strongly structurally controllable. Second, the pinning controllers are carried out to render an arbitrary BN controllable through node-to-node message exchange in a distributed form while traditional results only check the controllability of BNs with the preassigned controllers. Notably, the time complexity to design such controllers reduces to be only exponential with the maximal in-degree of pinned nodes rather than the node number of networks. As for the stochastic counterpart, upon the equivalence between the asymptotic stability of stochastic BNs and the criteria of strong structural controllability, we also further facilitate the design of distributed controllers to asymptotically stabilize stochastic BNs in probability.
- 21 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (3) , 1886-1893
Distributed Pinning Set Stabilization of Large-Scale Boolean Networks
In this article, we design the distributed pinning controllers to globally stabilize a Boolean network (BN), specially a sparsely connected large-scale one, towards a preassigned subset of state space through the node-to-node message exchange. Given an appointed state set, system nodes are partitioned into two disjoint parts, which respectively gather the nodes whose states are fixed or arbitrary with respect to the given state set. With such node division, three parts of pinned nodes are selected and the state feedback controllers are accordingly designed such that the resulting BN satisfies three conditions: the states of the other nodes cannot affect the nodal dynamics of fixed-state nodes, the subgraph of network structure induced by the fixed-state nodes is acyclic, and the steady state of the subnetwork induced by the fixed-state nodes lies in the state set given beforehand. If the BN after control is acyclic, the stabilizing time is revealed to be no more than the length of the longest path in the current network structure plus one. This enables us to further design the pinning controllers with the constraint of stabilizing time. Noting that the overall procedure runs in an
- 21 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (3) , 1886-1893
Distributed Pinning Set Stabilization of Large-Scale Boolean Networks
In this article, we design the distributed pinning controllers to globally stabilize a Boolean network (BN), specially a sparsely connected large-scale one, towards a preassigned subset of state space through the node-to-node message exchange. Given an appointed state set, system nodes are partitioned into two disjoint parts, which respectively gather the nodes whose states are fixed or arbitrary with respect to the given state set. With such node division, three parts of pinned nodes are selected and the state feedback controllers are accordingly designed such that the resulting BN satisfies three conditions: the states of the other nodes cannot affect the nodal dynamics of fixed-state nodes, the subgraph of network structure induced by the fixed-state nodes is acyclic, and the steady state of the subnetwork induced by the fixed-state nodes lies in the state set given beforehand. If the BN after control is acyclic, the stabilizing time is revealed to be no more than the length of the longest path in the current network structure plus one. This enables us to further design the pinning controllers with the constraint of stabilizing time. Noting that the overall procedure runs in an
- 3 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (8) , 4162-4169
SensorsDesign for Large-Scale Boolean Networks via Pinning Observability
In this article, a set of sensors is constructed via the pinning observability approach with the help of observability criteria given in [1] and [2], in order tomake the given Boolean network (BN)be observable. Given the assumption that system states can be accessible, an efficient pinning control scheme is developed to generate an observable BN by adjusting the network structure rather than just to check system observability. Accordingly, the sensors are constructed, of which the form is consistent with that of state feedback controllers in the designed pinning control. Since this pinning control approach only utilizes node-to-node message communication instead of global state space information, the time complexity is dramatically reduced from $O(2^{2n})$ to $O(n^2+n2^d)$ , where $n\, {\text{and}}\, d$ are respectively the node number of the considered BN and the largest in-degree of vertices in its network structure. Finally, we design the sensors for the reduced D. melanogaster segmentation polarity gene network and the T-cell receptor kinetics, respectively.
- 3 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (8) , 4162-4169
SensorsDesign for Large-Scale Boolean Networks via Pinning Observability
In this article, a set of sensors is constructed via the pinning observability approach with the help of observability criteria given in [1] and [2], in order tomake the given Boolean network (BN)be observable. Given the assumption that system states can be accessible, an efficient pinning control scheme is developed to generate an observable BN by adjusting the network structure rather than just to check system observability. Accordingly, the sensors are constructed, of which the form is consistent with that of state feedback controllers in the designed pinning control. Since this pinning control approach only utilizes node-to-node message communication instead of global state space information, the time complexity is dramatically reduced from $O(2^{2n})$ to $O(n^2+n2^d)$ , where $n\, {\text{and}}\, d$ are respectively the node number of the considered BN and the largest in-degree of vertices in its network structure. Finally, we design the sensors for the reduced D. melanogaster segmentation polarity gene network and the T-cell receptor kinetics, respectively.