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 条
  • [1] A Polynomial-Time Criterion for Stability in Distribution of Probabilistic Boolean Networks
    Pang, Xiaojun
    Li, Haitao
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2024, 71 (09) : 4256 - 4260
  • [2] A Polynomial-Time Algorihm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks
    Weiss, Eyal
    Margaliot, Michael
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (07) : 2727 - 2736
  • [3] Polynomial-Time Controllability Analysis of Boolean Networks
    Kobayashi, Koichi
    Imura, Jun-ichi
    Hiraishi, Kunihiko
    2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9, 2009, : 1694 - +
  • [4] Polynomial-Time Carsharing Optimization: Linear Formulation and Large-Scale Simulations
    Monteiro, Cristiano Martins
    Davis Jr, Clodoveu A. A.
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2023, 24 (04) : 4428 - 4437
  • [5] Large-scale inference of conjunctive Bayesian networks
    Montazeri, Hesam
    Kuipers, Jack
    Kouyos, Roger
    Boni, Jurg
    Yerly, Sabine
    Klimkait, Thomas
    Aubert, Vincent
    Gunthard, Huldrych F.
    Beerenwinkel, Niko
    BIOINFORMATICS, 2016, 32 (17) : 727 - 735
  • [6] Polynomial-Time Algorithm for Controllability Test of a Class of Boolean Biological Networks
    Kobayashi, Koichi
    Imura, Jun-Ichi
    Hiraishi, Kunihiko
    EURASIP JOURNAL ON BIOINFORMATICS AND SYSTEMS BIOLOGY, 2010, (01):
  • [7] Stability analysis of large-scale Boolean networks via compositional method
    Li, Haitao
    Pang, Xiaojun
    AUTOMATICA, 2024, 159
  • [8] Stability structures of conjunctive Boolean networks
    Gao, Zuguang
    Chen, Xudong
    Basar, Tamer
    AUTOMATICA, 2018, 89 : 8 - 20
  • [9] Polynomial-time versus computable Boolean algebras
    Cenzer, D
    Remmel, JB
    RECURSION THEORY AND COMPLEXITY, 1999, 2 : 15 - 53
  • [10] Minimum time control of large-scale boolean control networks with constraints
    Pan, Jinfeng
    Feng, Jun-e
    Meng, Min
    Zhao, Jianli
    ASIAN JOURNAL OF CONTROL, 2019, 21 (06) : 2532 - 2542
12345