Observability Criteria for Boolean Networks

Yongyuan Yu

doi:10.1109/TAC.2021.3131436

Observability Criteria for Boolean Networks

2022-11-01

21

PRE

AI

DOI：10.1109/TAC.2021.3131436

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Observability

Symmetric matrices

Probabilistic logic

Germanium

Boolean functions

Aerospace electronics

Upper bound

Boolean control network (BCN)

nonaugmented method

observability

probabilistic Boolean network (PBN)

Observability Criteria for Boolean Networks

Abstract

Journal

Organization