IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v496y2025ics0096300325000657.html
   My bibliography  Save this article

Set stabilization of Boolean control networks based on bisimulations: A dimensionality reduction approach

Author

Listed:
  • Mu, Tiantian
  • Feng, Jun-e
  • Wang, Biao

Abstract

This paper exploits bisimulation relations, generated by extracting the concept of morphisms between algebraic structures, to analyze set stabilization of Boolean control networks with lower complexity. First, for two kinds of bisimulation relations, called as weak bisimulation and strong bisimulation relations, a novel verification method is provided by constructing the bisimulation matrices. Then the comparison for set stabilization of BCNs via two kinds of bisimulation methods is presented, which involves the dimensionality of quotient systems and dependency of the control laws on the original system. Moreover, the proposed method is also applied to the analysis of probabilistic Boolean control networks to establish the unified analysis framework of bisimulations. Finally, the validity of the obtained results is verified by the practical example.

Suggested Citation

  • Mu, Tiantian & Feng, Jun-e & Wang, Biao, 2025. "Set stabilization of Boolean control networks based on bisimulations: A dimensionality reduction approach," Applied Mathematics and Computation, Elsevier, vol. 496(C).
    • Handle: RePEc:eee:apmaco:v:496:y:2025:i:c:s0096300325000657
    DOI: 10.1016/j.amc.2025.129338
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325000657
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129338?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zhang, Anguo & Li, Lulu & Li, Yuanyuan & Lu, Jianquan, 2021. "Finite-time output tracking of probabilistic Boolean control networks," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    2. Wang, Yong & Zhong, Jie & Pan, Qinyao & Li, Ning, 2024. "Minimal pinning control for set stability of Boolean networks," Applied Mathematics and Computation, Elsevier, vol. 465(C).
    3. Zhang, Qiliang & Feng, Jun-e & Wang, Biao & Wang, Peihe, 2020. "Event-triggered mechanism of designing set stabilization state feedback controller for switched Boolean networks," Applied Mathematics and Computation, Elsevier, vol. 383(C).
    4. Li, Xiaodong & Li, Haitao & Li, Yalu & Yang, Xinrong, 2020. "Function perturbation impact on stability in distribution of probabilistic Boolean networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 177(C), pages 1-12.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiangshan Kong & Qilong Sun & Haitao Li, 2022. "Survey on Mathematical Models and Methods of Complex Logical Dynamical Systems," Mathematics, MDPI, vol. 10(20), pages 1-17, October.
    2. Tang, Li & Liu, Wei & Liu, Yan-Jun, 2024. "Dual design of control law and switching law for turbofan systems under multiple disturbances," Energy, Elsevier, vol. 296(C).
    3. Li, Yalu & Li, Haitao & Li, Yuanyuan, 2021. "Constrained set controllability of logical control networks with state constraints and its applications," Applied Mathematics and Computation, Elsevier, vol. 405(C).
    4. Zhang, Anguo & Li, Lulu & Li, Yuanyuan & Lu, Jianquan, 2021. "Finite-time output tracking of probabilistic Boolean control networks," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    5. Wang, Jianjun & Liu, Wen & Fu, Shihua & Xia, Jianwei, 2022. "On robust set stability and set stabilization of probabilistic Boolean control networks," Applied Mathematics and Computation, Elsevier, vol. 422(C).
    6. Qilong Sun & Haitao Li, 2022. "Robust Stabilization of Impulsive Boolean Control Networks with Function Perturbation," Mathematics, MDPI, vol. 10(21), pages 1-12, October.
    7. Gao, Yuxuan & Zhao, Ying & Liu, Yu & Pan, Zhuo-Rui & Wang, Rui, 2023. "Output tracking anti-disturbance control for turbofan systems," Applied Mathematics and Computation, Elsevier, vol. 456(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:496:y:2025:i:c:s0096300325000657. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.