Identification of Boolean control networks

From MaRDI portal
Publication:534280

DOI10.1016/J.AUTOMATICA.2011.01.083zbMATH Open1215.93035arXiv2104.14144OpenAlexW2101408219MaRDI QIDQ534280FDOQ534280


Authors: Daizhan Cheng, Yin Zhao Edit this on Wikidata


Publication date: 17 May 2011

Published in: Automatica (Search for Journal in Brave)

Abstract: A new analytical framework consisting of two phenomena: single sample and multiple samples, is proposed to deal with the identification problem of Boolean control networks (BCNs) systematically and comprehensively. Under this framework, the existing works on identification can be categorized as special cases of these two phenomena. Several effective criteria for determining the identifiability and the corresponding identification algorithms are proposed. Three important results are derived: (1) If a BN is observable, it is uniquely identifiable; (2) If a BCN is O1-observable, it is uniquely identifiable, where O1-observability is the most general form of the existing observability terms; (3) A BN or BCN may be identifiable, but not observable. In addition, remarks present some challenging future research and contain a preliminary attempt about how to identify unobservable systems.


Full work available at URL: https://arxiv.org/abs/2104.14144




Recommendations




Cites Work


Cited In (49)

Uses Software





This page was built for publication: Identification of Boolean control networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534280)