Pinning detectability of Boolean control networks with injection mode (Q2090514): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Jun-E. Feng / rank | |||
Property / reviewed by | |||
Property / reviewed by: Juan Ramón Torregrosa Sánchez / rank | |||
Revision as of 07:16, 15 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pinning detectability of Boolean control networks with injection mode |
scientific article |
Statements
Pinning detectability of Boolean control networks with injection mode (English)
0 references
25 October 2022
0 references
This manuscript deals with analytical studies on detectability of Boolean networks with pinning and injection mode (BNPCIM). For a Boolean control network, observability is to study whether the system can uniquely judge its initial states by the known information. As a generalization of observability, detectability of Boolean control networks means that the current states can be uniquely determined by input-output data. In this paper, the authors propose three types of detectability for BNPCIM by Cheng product of matrices. They define BNPCIM weakly detectable, detectable and strongly detectable, depending of the existence of \(s \in \mathbb{N}\) and injection modes such that for some or any control and some or any output sequences, state \(x(s)\) can be uniquely determined. The main contributions of this manuscript can be summarized as follows: \begin{itemize} \item[(a)] Three types of detectability are presented to better describe the characters of the system. \item[(b)] According to free and networked patterns of injection mode and control, the authors design a sequence of matrices to reflect the corresponding output and state information under different injection modes and controls. \item[(c)] By using these matrices, the authors obtain several necessary and sufficient conditions for different detectability under free and networked input conditions, respectively. \item[(d)] The number of maximum steps to verify whether the system can satisfy multiple detectability is bounded. \end{itemize} Finally, two examples are presented to show the feasibility of the proposed methods.
0 references
Boolean control networks
0 references
Cheng product of matrices
0 references
detectability
0 references
injection mode
0 references
pinning control
0 references