Observability Criteria for Boolean Networks

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...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 67; no. 11; pp. 6248 - 6254
Main Authors Yu, Yongyuan, Meng, Min, Feng, Jun-e, Chen, Ge
Format Journal Article
LanguageEnglish
Published New York IEEE 01.11.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Aerospace electronics
Algorithms
Boolean algebra
Boolean control network (BCN)
Boolean functions
Complexity
Criteria
Germanium
Networks
nonaugmented method
Observability
probabilistic Boolean network (PBN)
Probabilistic logic
Symmetric matrices
Upper bound
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2021.3131436