Observability Criteria for Boolean Networks

成果类型:
Article
署名作者:
Yu, Yongyuan; Meng, Min; Feng, Jun-E; Chen, Ge
署名单位:
Shandong University; Chinese Academy of Sciences; Academy of Mathematics & System Sciences, CAS; Tongji University; Tongji University; Chinese Academy of Sciences; Academy of Mathematics & System Sciences, CAS
刊物名称:
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
ISSN/ISSBN:
0018-9286
DOI:
10.1109/TAC.2021.3131436
发表日期:
2022
页码:
6248-6254
关键词:
Observability Symmetric matrices Probabilistic logic germanium BOOLEAN FUNCTIONS Aerospace electronics Upper bound Boolean control network (BCN) nonaugmented method observability probabilistic Boolean network (PBN)
摘要:
This article investigates observability of Boolean control networks (BCNs) and probabilistic Boolean networks (PBNs). First, weak observability of BCNs is discussed via the nonaugmented approach. The obtained result is then applied to determine (asymptotic) observability of PBNs. Finally, complexity of algorithms based on new criteria is analyzed. Compared with existing ones, time and space complexity do not get worse, even are improved under some mild conditions.
来源URL: