.png){kind=icon}
.png){kind=icon}
Return
Redefined Reconstructibility and State Estimation for Boolean Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2020.3007820.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article deals with the issues of reconstructibility analysis and state estimation for Boolean networks (BNs). At first, the reconstructibility of BNs is redefined where the concepts of globally reconstructible, locally reconstructible, and unreconstructible are proposed, which determines whether the state observer exists for a given BN or not. After that, for a reconstructible BN, a state observer is proposed to uniquely estimate the system state online in finite time steps. Then, an algorithm is provided to summarize the design process of the observer. Based on the proposed state estimation method, a kind of special algorithm is presented to determine the reconstructiblity of BNs, which can be implemented offline and guarantee the existence of state observers. Finally, examples are given to illustrate the effectiveness of the proposed methods.
Keywords:
Boolean networks (BNs)
reconstructibility
semitensor product of matrices
state estimation
state observer
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K