Pinning Stabilization of Logical Networks Based on Deformation of the State Transition Matrix

IF 6.4 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Jiayang Liu;Amol Yerudkar;Shuting Sun;Yang Liu
{"title":"Pinning Stabilization of Logical Networks Based on Deformation of the State Transition Matrix","authors":"Jiayang Liu;Amol Yerudkar;Shuting Sun;Yang Liu","doi":"10.1109/TASE.2025.3583327","DOIUrl":null,"url":null,"abstract":"Boolean Networks (BNs) are a powerful model to describe the way in which genes work and holistically interact with one another in system biology. Based on the requirement to guide the systems to a desired state, the stabilization problem becomes an important issue in BNs. Since the normal state feedback control puts controllers to all nodes, the control cost is relatively high. In this paper, we investigate the stabilization problem of BNs under pinning control strategy. Meanwhile, to cut down the cost of control to the most, the set of pinned nodes is minimized. Specifically, a four-procedure method as well as the corresponding computationally feasible algorithms are proposed to determine a minimum set of controlled nodes based on a deformed state transition matrix and a constructed digraph. In comparison with the strategy that is traditionally based on the state transition matrix, the proposed approach can effectively reduce the computational complexity. Finally, gene networks are discussed as simulations, which demonstrate the effectiveness of the proposed method, minimizing the number of controlled nodes with lower time complexity. Note to Practitioners—BNs are commonly used to explore gene interactions and evolutions in modeling and analyzing cellular processes and neural networks. When it comes to biological systems or genetic networks, it’s critical to create therapeutic interventions that guide patients toward and sustain desired states, like health. Thus, the requirement to steer BNs to a preassigned state through control design is what motivates this study. In order to ensure the arbitrariness of the preassigned state and minimize the control cost, pinning control with minimum controlled nodes is a wise option. However, existing pinning strategies based on state transition matrix generally fall short of practice due to the high time complexity. To address the issue, the present work proposes a four-procedure pinning control method via a graph method to seek for the minimum set of pinned nodes with lower time complexity and verifies on different gene networks.","PeriodicalId":51060,"journal":{"name":"IEEE Transactions on Automation Science and Engineering","volume":"22 ","pages":"17199-17208"},"PeriodicalIF":6.4000,"publicationDate":"2025-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Automation Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11052683/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Boolean Networks (BNs) are a powerful model to describe the way in which genes work and holistically interact with one another in system biology. Based on the requirement to guide the systems to a desired state, the stabilization problem becomes an important issue in BNs. Since the normal state feedback control puts controllers to all nodes, the control cost is relatively high. In this paper, we investigate the stabilization problem of BNs under pinning control strategy. Meanwhile, to cut down the cost of control to the most, the set of pinned nodes is minimized. Specifically, a four-procedure method as well as the corresponding computationally feasible algorithms are proposed to determine a minimum set of controlled nodes based on a deformed state transition matrix and a constructed digraph. In comparison with the strategy that is traditionally based on the state transition matrix, the proposed approach can effectively reduce the computational complexity. Finally, gene networks are discussed as simulations, which demonstrate the effectiveness of the proposed method, minimizing the number of controlled nodes with lower time complexity. Note to Practitioners—BNs are commonly used to explore gene interactions and evolutions in modeling and analyzing cellular processes and neural networks. When it comes to biological systems or genetic networks, it’s critical to create therapeutic interventions that guide patients toward and sustain desired states, like health. Thus, the requirement to steer BNs to a preassigned state through control design is what motivates this study. In order to ensure the arbitrariness of the preassigned state and minimize the control cost, pinning control with minimum controlled nodes is a wise option. However, existing pinning strategies based on state transition matrix generally fall short of practice due to the high time complexity. To address the issue, the present work proposes a four-procedure pinning control method via a graph method to seek for the minimum set of pinned nodes with lower time complexity and verifies on different gene networks.
基于状态转移矩阵变形的逻辑网络钉住稳定
布尔网络(BNs)是描述系统生物学中基因工作方式和整体相互作用的强大模型。基于将系统引导到理想状态的要求,稳定问题成为网络中的一个重要问题。由于正常状态反馈控制将控制器置于所有节点,控制成本较高。本文研究了在钉住控制策略下神经网络的镇定问题。同时,为了最大限度地降低控制成本,将固定节点集最小化。具体而言,提出了一种基于变形状态转移矩阵和构造有向图确定最小控制节点集的四步骤方法和相应的计算可行算法。与传统的基于状态转移矩阵的策略相比,该方法可以有效地降低计算复杂度。最后,对基因网络进行了仿真,验证了所提方法的有效性,以较低的时间复杂度实现了控制节点数量的最小化。从业人员注意事项-生物神经网络通常用于探索基因相互作用和进化,建模和分析细胞过程和神经网络。当涉及到生物系统或遗传网络时,创造治疗干预措施以引导患者达到并维持所需状态(如健康)是至关重要的。因此,通过控制设计将bp引导到预定状态的需求是本研究的动机。为了保证预分配状态的任意性并使控制成本最小化,采用最小控制节点的固定控制是一种明智的选择。然而,现有的基于状态转移矩阵的固定策略由于时间复杂度高,普遍不符合实际。为了解决这一问题,本文提出了一种基于图的四步骤钉住控制方法,以寻求具有较低时间复杂度的最小钉住节点集,并在不同的基因网络上进行验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Automation Science and Engineering
IEEE Transactions on Automation Science and Engineering 工程技术-自动化与控制系统
CiteScore
12.50
自引率
14.30%
发文量
404
审稿时长
3.0 months
期刊介绍: The IEEE Transactions on Automation Science and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. T-ASE welcomes results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, security, service, supply chains, and transportation. T-ASE addresses a research community willing to integrate knowledge across disciplines and industries. For this purpose, each paper includes a Note to Practitioners that summarizes how its results can be applied or how they might be extended to apply in practice.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信