A polynomial-time criterion for stability of large-scale switched conjunctive Boolean networks☆

被引：4
|
作者：
Li, Haitao [1 ]
Pang, Xiaojun [1 ]
机构：
[1] Shandong Normal Univ, Sch Math & Stat, Jinan 250014, Peoples R China
来源：
AUTOMATICA | 2024年 / 159卷
基金：
中国国家自然科学基金;
关键词：
Large-scale network; Switched conjunctive Boolean network; Stability; Polynomial -time criterion; Node removal; CELL-DIFFERENTIATION; REGULATORY NETWORKS; MULTISTATIONARITY; CONTROLLABILITY; OBSERVABILITY; ALGORITHMS; MEMORY;
D O I：
10.1016/j.automatica.2023.111340
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper investigates the global stability of large-scale switched conjunctive Boolean networks (SCBNs) under arbitrary switching signal from the graph-theoretic perspective. With the help of node removal technique, the Thomas' rule in Boolean case is proved, that is, a Boolean network is globally stable when its network graph is acyclic, and meanwhile the stable equilibrium is constructed. Secondly, the combination of node removal and Thomas' rule is used to analyse the stability of each mode in SCBNs. Thirdly, when the joint graph is weakly connected and acyclic, a polynomial-time criterion is built for the global stability of large-scale SCBNs under arbitrary switching signal. Finally, the application on the SCBN model in the processing of Toll ligand Spz demonstrates the effectiveness of the criterion.
引用
收藏
页数：9
相关论文
共 50 条
  • [31] Polynomial-time quantum algorithms for finding the linear structures of Boolean function
    Wu, WanQing
    Zhang, HuanGuo
    Wang, HouZhen
    Mao, ShaoWu
    QUANTUM INFORMATION PROCESSING, 2015, 14 (04) : 1215 - 1226
  • [32] EQUIVALENCE OF FREE BOOLEAN GRAPHS CAN BE DECIDED PROBABILISTICALLY IN POLYNOMIAL-TIME
    BLUM, M
    CHANDRA, AK
    WEGMAN, MN
    INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 80 - 82
  • [33] Stability analysis for switched singular Boolean networks
    Li, Hai-Tao
    Wang, Yu-Zhen
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2014, 31 (07): : 908 - 914
  • [34] Global Stability and Controllability of Switched Boolean Networks
    Li Haitao
    PROCEEDINGS OF THE 31ST CHINESE CONTROL CONFERENCE, 2012, : 82 - 88
  • [35] A NEW STABILITY-CRITERION FOR LARGE-SCALE SYSTEMS WITH DELAYS
    WANG, WJ
    SONG, CC
    CONTROL-THEORY AND ADVANCED TECHNOLOGY, 1989, 5 (03): : 315 - 322
  • [36] IDENTIFYING 2-MONOTONIC POSITIVE BOOLEAN FUNCTIONS IN POLYNOMIAL-TIME
    BOROS, E
    HAMMER, PL
    IBARAKI, T
    KAWAKAMI, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 104 - 115
  • [37] Stability of Switched Boolean Networks with Restricted Successors
    Chen, Yuxia
    Guo, Yuqian
    Gui, Weihua
    2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC), 2021, : 962 - 967
  • [38] Polynomial-time quantum algorithms for finding the linear structures of Boolean function
    WanQing Wu
    HuanGuo Zhang
    HouZhen Wang
    ShaoWu Mao
    Quantum Information Processing, 2015, 14 : 1215 - 1226
  • [39] Disease Spread over Randomly Switched Large-scale Networks
    Ogura, Masaki
    Preciado, Victor M.
    2015 AMERICAN CONTROL CONFERENCE (ACC), 2015, : 1782 - 1787
  • [40] TRAFFIC DESIGN METHOD FOR LARGE-SCALE SWITCHED TELECOMMUNICATION NETWORKS
    MASE, K
    KAWANO, W
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, 1995, 78 (08): : 10 - 22
12345