Back to Search
Start Over
Minimal pinning control for set stability of Boolean networks.
- Source :
-
Applied Mathematics & Computation . Mar2024, Vol. 465, pN.PAG-N.PAG. 1p. - Publication Year :
- 2024
-
Abstract
- In this paper, set stability of Boolean networks (BNs) is studied based on semi-tensor product of matrices. First, an index-vector is introduced to verify whether a BN can be set stable from an initial set to a destination set. Then, an algorithm is proposed to obtain the minimal set of pinning nodes to achieve set stability, if a BN is not set stable. Moreover, in order to reduce the computational complexity, a hybrid pinning control technique is proposed, where the designed controllers are not entirely dependent on all the nodes of the networks. Further, the issue of synchronization is discussed by using the proposed hybrid pinning control methods. Finally, simulations are presented to illustrate the effectiveness of the obtained results in this paper. • Based on an index-vector, a new necessary and sufficient condition has been obtained for set stability of Boolean networks from an initial state set to a destination state set. • Compared to the existing methods, fewer pinning nodes have been found to achieve global stability for a Boolean network by using the proposed method in this paper. • By using hybrid pinning control, pinning controllers have been simplified and the computational complexity has been reduced. [ABSTRACT FROM AUTHOR]
- Subjects :
- *BOOLEAN networks
*COMPUTATIONAL complexity
*MATRIX multiplications
Subjects
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 465
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 174036291
- Full Text :
- https://doi.org/10.1016/j.amc.2023.128433