Open AccessObservability of Boolean networks via STP and graph methods
Author(s) -
Liu Huachao,
Liu Yang,
Li Yuanyuan,
Wang Zhen,
Alsaadi Fuad E.
Publication year - 2019
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2018.5279
Subject(s) - unobservable , observability , observable , state (computer science) , mathematics , graph , matrix (chemical analysis) , computer science , theoretical computer science , discrete mathematics , algorithm , physics , materials science , quantum mechanics , composite material , econometrics
This study addresses the observability of Boolean networks (BNs), using semi‐tensor product (STP) of matrices. First, unobservable states can be divided into two types, and the first type of unobservable states can be easily determined by blocking idea. Second, it is found that all states reaching to observable states are observable. Based on subgraph of transition matrix and blocking idea, the second type of unobservable states can be also determined. Approaches are obtained to directly determine some observable or unobservable states. An algorithm is designed for determining the observability of BNs as well. Examples are given to illustrate the effectiveness of the given results.