CoChat

Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata

Open access
Zhang, Kuize, Zhang, Lijun · 2016 · IEEE Transactions on Automatic Control
Cited by 171

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.2015.2501365

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata. https://app.cochat.ai/papers/10.1109/tac.2015.2501365
The paper
Zhang, K., & Zhang, L. (2016). Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2015.2501365

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.