File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Observability Categorization for Boolean Control Networks

TitleObservability Categorization for Boolean Control Networks
Authors
KeywordsBoolean control networks
graph theory
matrix polynomial
observability categorization
semi-tensor product of matrices
Issue Date23-Oct-2023
PublisherInstitute of Electrical and Electronics Engineers
Citation
IEEE Transactions on Network Science and Engineering, 2023, v. 11, n. 1, p. 1374-1386 How to Cite?
AbstractThis 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 Identifierhttp://hdl.handle.net/10722/344614
ISSN
2023 Impact Factor: 6.7
2023 SCImago Journal Rankings: 2.167

 

DC FieldValueLanguage
dc.contributor.authorLin, Lin-
dc.contributor.authorLam, James-
dc.date.accessioned2024-07-31T06:22:33Z-
dc.date.available2024-07-31T06:22:33Z-
dc.date.issued2023-10-23-
dc.identifier.citationIEEE Transactions on Network Science and Engineering, 2023, v. 11, n. 1, p. 1374-1386-
dc.identifier.issn2327-4697-
dc.identifier.urihttp://hdl.handle.net/10722/344614-
dc.description.abstractThis 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.languageeng-
dc.publisherInstitute of Electrical and Electronics Engineers-
dc.relation.ispartofIEEE Transactions on Network Science and Engineering-
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.-
dc.subjectBoolean control networks-
dc.subjectgraph theory-
dc.subjectmatrix polynomial-
dc.subjectobservability categorization-
dc.subjectsemi-tensor product of matrices-
dc.titleObservability Categorization for Boolean Control Networks-
dc.typeArticle-
dc.identifier.doi10.1109/TNSE.2023.3322567-
dc.identifier.scopuseid_2-s2.0-85174857050-
dc.identifier.volume11-
dc.identifier.issue1-
dc.identifier.spage1374-
dc.identifier.epage1386-
dc.identifier.eissn2327-4697-
dc.identifier.issnl2327-4697-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats