{"title":"概率逻辑控制网络的可观察性与可重构性验证系统分析","authors":"Yalu Li;Haitao Li;Gaoxi Xiao","doi":"10.1109/TCSI.2025.3553463","DOIUrl":null,"url":null,"abstract":"Observability and reconstructibility are two fundamental issues in modern control theory, which are important in both state estimation and observer design. The existing results for verifying the observability and reconstructibility of probabilistic logical control networks (PLCNs) have exponential complexities. This article presents a new approach to verify the observability and reconstructibility of PLCNs, which can greatly reduce the computational complexity. Specifically, the problem is tackled in three different steps. Firstly, based on the division of the state pair space, an observability verification system is established. Secondly, the equivalence between the stabilization of the proposed observability verification system and the observability of PLCNs is revealed, and a new criterion is established to solve the observability of PLCNs. Under the framework, the computational complexity is discussed. Thirdly, the relationship between observability and reconstructibility of PLCNs is unveiled, and some new criteria are established to solve two kinds of reconstructibility problems for PLCNs. Finally, an example of a biological network, apoptosis network, is presented to demonstrate the feasibility of the methods proposed in this article.","PeriodicalId":13039,"journal":{"name":"IEEE Transactions on Circuits and Systems I: Regular Papers","volume":"72 8","pages":"4273-4283"},"PeriodicalIF":5.2000,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Observability Verification System Analysis for Observability and Reconstructibility of Probabilistic Logical Control Networks\",\"authors\":\"Yalu Li;Haitao Li;Gaoxi Xiao\",\"doi\":\"10.1109/TCSI.2025.3553463\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Observability and reconstructibility are two fundamental issues in modern control theory, which are important in both state estimation and observer design. The existing results for verifying the observability and reconstructibility of probabilistic logical control networks (PLCNs) have exponential complexities. This article presents a new approach to verify the observability and reconstructibility of PLCNs, which can greatly reduce the computational complexity. Specifically, the problem is tackled in three different steps. Firstly, based on the division of the state pair space, an observability verification system is established. Secondly, the equivalence between the stabilization of the proposed observability verification system and the observability of PLCNs is revealed, and a new criterion is established to solve the observability of PLCNs. Under the framework, the computational complexity is discussed. Thirdly, the relationship between observability and reconstructibility of PLCNs is unveiled, and some new criteria are established to solve two kinds of reconstructibility problems for PLCNs. Finally, an example of a biological network, apoptosis network, is presented to demonstrate the feasibility of the methods proposed in this article.\",\"PeriodicalId\":13039,\"journal\":{\"name\":\"IEEE Transactions on Circuits and Systems I: Regular Papers\",\"volume\":\"72 8\",\"pages\":\"4273-4283\"},\"PeriodicalIF\":5.2000,\"publicationDate\":\"2025-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Circuits and Systems I: Regular Papers\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10955701/\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Circuits and Systems I: Regular Papers","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10955701/","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
Observability Verification System Analysis for Observability and Reconstructibility of Probabilistic Logical Control Networks
Observability and reconstructibility are two fundamental issues in modern control theory, which are important in both state estimation and observer design. The existing results for verifying the observability and reconstructibility of probabilistic logical control networks (PLCNs) have exponential complexities. This article presents a new approach to verify the observability and reconstructibility of PLCNs, which can greatly reduce the computational complexity. Specifically, the problem is tackled in three different steps. Firstly, based on the division of the state pair space, an observability verification system is established. Secondly, the equivalence between the stabilization of the proposed observability verification system and the observability of PLCNs is revealed, and a new criterion is established to solve the observability of PLCNs. Under the framework, the computational complexity is discussed. Thirdly, the relationship between observability and reconstructibility of PLCNs is unveiled, and some new criteria are established to solve two kinds of reconstructibility problems for PLCNs. Finally, an example of a biological network, apoptosis network, is presented to demonstrate the feasibility of the methods proposed in this article.
期刊介绍:
TCAS I publishes regular papers in the field specified by the theory, analysis, design, and practical implementations of circuits, and the application of circuit techniques to systems and to signal processing. Included is the whole spectrum from basic scientific theory to industrial applications. The field of interest covered includes: - Circuits: Analog, Digital and Mixed Signal Circuits and Systems - Nonlinear Circuits and Systems, Integrated Sensors, MEMS and Systems on Chip, Nanoscale Circuits and Systems, Optoelectronic - Circuits and Systems, Power Electronics and Systems - Software for Analog-and-Logic Circuits and Systems - Control aspects of Circuits and Systems.