9 citations · 16 across the 4 of their papers we have counts for
Showing eess.SYShow all
2 papers · 1 filter
eess.SY2021★ 4 cited
Polynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices
Shiyong Zhu, Jianquan Lu, Daniel W. C. Ho +1
The aim of this paper is to characterize an important class of marked digraphs, called structurally observable graphs (SOGs), and to solve two minimum realization problems. To begi…
eess.SY2019
A New Approach to Pinning Control of Boolean Networks
Jie Zhong, Daniel W. C. Ho, Jianquan Lu
Boolean networks (BNs) are discrete-time systems where nodes are inter-connected (here we call such connection rule among nodes as network structure), and the dynamics of each gene…