File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TNSE.2023.3322567
- Scopus: eid_2-s2.0-85174857050
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Observability Categorization for Boolean Control Networks
Title | Observability Categorization for Boolean Control Networks |
---|---|
Authors | |
Keywords | Boolean control networks graph theory matrix polynomial observability categorization semi-tensor product of matrices |
Issue Date | 23-Oct-2023 |
Publisher | Institute of Electrical and Electronics Engineers |
Citation | IEEE Transactions on Network Science and Engineering, 2023, v. 11, n. 1, p. 1374-1386 How to Cite? |
Abstract | This article studies the observability categorization of Boolean control networks, for which the observability regarding each state pair is classified into four categories: indistinguishable, transient, primitive, and imprimitive ones. The observability categorization is guided by the distinguishable time domain of each state pair, which provides an indication of when to add the observer. First, the notion of the k-step distinguishability is presented and fully characterized. Then, two necessary and sufficient conditions are established to determine the observability categorization, respectively, from the graph-theoretic and algebraic perspectives. Finally, the observability categorization for a biological example about the lac operon in Escherichia coli and a constructive example is studied to illustrate the effectiveness of the theoretical methods. |
Persistent Identifier | http://hdl.handle.net/10722/344614 |
ISSN | 2023 Impact Factor: 6.7 2023 SCImago Journal Rankings: 2.167 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, Lin | - |
dc.contributor.author | Lam, James | - |
dc.date.accessioned | 2024-07-31T06:22:33Z | - |
dc.date.available | 2024-07-31T06:22:33Z | - |
dc.date.issued | 2023-10-23 | - |
dc.identifier.citation | IEEE Transactions on Network Science and Engineering, 2023, v. 11, n. 1, p. 1374-1386 | - |
dc.identifier.issn | 2327-4697 | - |
dc.identifier.uri | http://hdl.handle.net/10722/344614 | - |
dc.description.abstract | This article studies the observability categorization of Boolean control networks, for which the observability regarding each state pair is classified into four categories: indistinguishable, transient, primitive, and imprimitive ones. The observability categorization is guided by the distinguishable time domain of each state pair, which provides an indication of when to add the observer. First, the notion of the k-step distinguishability is presented and fully characterized. Then, two necessary and sufficient conditions are established to determine the observability categorization, respectively, from the graph-theoretic and algebraic perspectives. Finally, the observability categorization for a biological example about the lac operon in Escherichia coli and a constructive example is studied to illustrate the effectiveness of the theoretical methods. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.relation.ispartof | IEEE Transactions on Network Science and Engineering | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.subject | Boolean control networks | - |
dc.subject | graph theory | - |
dc.subject | matrix polynomial | - |
dc.subject | observability categorization | - |
dc.subject | semi-tensor product of matrices | - |
dc.title | Observability Categorization for Boolean Control Networks | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/TNSE.2023.3322567 | - |
dc.identifier.scopus | eid_2-s2.0-85174857050 | - |
dc.identifier.volume | 11 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 1374 | - |
dc.identifier.epage | 1386 | - |
dc.identifier.eissn | 2327-4697 | - |
dc.identifier.issnl | 2327-4697 | - |