Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The problem on how to determine the observability of Boolean control networks (BCNs) has been open for five years already. In this technical note, we propose a unified approach to determine all the four types of observability of BCNs in the literature. We define the concept of weighted pair graphs for BCNs. In the sense of each observability, we use the so-called weighted pair graph to transform a BCN to a finite automaton, and then we use the automaton to determine observability. In particular, the two types of observability that rely on initial states and inputs in the literature are determined. Finally, we show that no pairs of the four types of observability are equivalent, which reveals the essence of nonlinearity of BCNs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Systems biology: a brief overview
Kitano, H. (2002) · Science · doi:10.1126/science.1069492 · Cited by 4,265
A N EW A PPROACH TO D ECODING L IFE : Systems Biology
Ideker, T., Galitski, T., & Hood, L. (2001) · Annual Review of Genomics and Human Genetics · doi:10.1146/annurev.genom.2.1.343 · Cited by 1,664 · cited 1×
“” Since then, the study on control-theoretic problems in the areas of Boolean networks (initiated by Kauffman [3] in 1969 to describe genetic regulatory networks) and Boolean control networks (initiated in [2] in 2001) has drawn vast attention (cf.”
Background
Metadata
- Authors
- Zhang, K., & Zhang, L.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2016-09
- Volume
- 61
- Issue
- 9
- Pages
- 2733-2738
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2344696827
- Cited by
- 171
- References
- 2
- FWCI
- 4.76
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.