Strong structural controllability of Boolean networks: Polynomial-time criteria, minimal node control, and distributed pinning strategies

S Zhu, J Lu, S Azuma, WX Zheng - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
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 …

Towards stabilizable large-scale Boolean networks by controlling the minimal set of nodes

S Zhu, J Cao, L Lin, J Lam… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
This article studies structural controllers and distributed pinning controllers for the global
stabilization of Boolean networks (BNs) by integrating the information on their network …

Distributed pinning set stabilization of large-scale Boolean networks

S Zhu, J Lu, L Sun, J Cao - IEEE Transactions on Automatic …, 2022 - ieeexplore.ieee.org
In this article, we design the distributed pinning controllers to globally stabilize a Boolean
network (BN), especially a sparsely connected large-scale one, toward a preassigned …

Leader–follower consensus of multiagent systems with time delays over finite fields

Y Li, H Li, X Ding, G Zhao - IEEE Transactions on cybernetics, 2018 - ieeexplore.ieee.org
This paper studies the leader-follower consensus of multiagent systems with time delays
and switching topology over finite fields. First, an equivalent algebraic form is established for …

Set stability of switched delayed logical networks with application to finite-field consensus

Y Li, H Li, X Ding - Automatica, 2020 - Elsevier
This paper investigates the set stability of switched delayed logical networks (SDLNs) by
using the semi-tensor product of matrices. The equivalent algebraic form of SDLNs is …

Minimal control nodes for strong structural observability of discrete-time iteration systems: Explicit formulas and polynomial-time algorithms

S Zhu, J Lu, DWC Ho, J Cao - IEEE Transactions on Automatic …, 2023 - ieeexplore.ieee.org
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 …

Consensus networks with switching topology and time-delays over finite fields

X Li, MZQ Chen, H Su, C Li - Automatica, 2016 - Elsevier
The consensus problem in networks with both switching topology and time-delays over finite
fields is investigated in this paper. The finite field, which is a kind of finite alphabet, is …

Synchronization of networks over finite fields

M Meng, X Li, G Xiao - Automatica, 2020 - Elsevier
In this paper, the synchronization problem for networks over finite fields is investigated,
which is a generalization of consensus and provides a new perspective for networks of …

Synchronization of finite field networks with switching multiple communication channels

J Zhang, J Lu, M Xing, J Liang - IEEE Transactions on Network …, 2021 - ieeexplore.ieee.org
In this paper, a novel communication constraint is introduced for the synchronization
problem of coupled agents over finite field networks. Given a network of interconnected …

Containment problem of finite-field networks with fixed and switching topology

Y Liu, M Song, H Li, Y Li, W Hou - Applied Mathematics and Computation, 2021 - Elsevier
The containment problem of finite-field networks (FFNs) with fixed topology (FT-FFNs) and
switching topology (ST-FFNs) is studied. Firstly, the concept of containment for FFNs is …