Stability and $l_1$ Gain Analysis of Boolean Networks With Markovian Jump Parameters
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
This paper presents some results on stability and l1gain analysis of Boolean networks with Markovian jump parameters. A necessary and sufficient condition for global stability of the concerned Boolean networks is given in terms of linear programming by utilizing the semi-tensor product of matrices and some properties of linear positive systems. Then, the definition of Lyapunov function for stochastic Boolean networks is presented and Lyapunov theorem is derived. Moreover, an l1gain problem for stochastic Boolean networks with external disturbances is formulated and solved by a sufficient condition. Examples are shown to illustrate the effectiveness of the obtained results.
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
A genomic regulatory network for development
Davidson, E. H., Rast, J. P., Oliveri, P., Ransick, A., Calestani, C., Yuh, C.-H., Minokawa, T., Amore, G., Hinman, V., Arenas-Mena, C., et al. (2002) · Science · doi:10.1126/science.1069883 · Cited by 1,567 · cited 1×
“Since Boolean networks (BNs) were first applied to model and describe genetic regulatory networks in 1969 [1], much attention has been drawn to the study and applications of BNs [2]–[7].”
Background
Metadata
- Authors
- Meng, M., Liu, L., & Feng, G.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2017-08
- Volume
- 62
- Issue
- 8
- Pages
- 4222-4228
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2594786382
- Cited by
- 181
- References
- 1
- FWCI
- 16.53
- Type
- journal article
- Language
- en
- Open access
- closed
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: Stability and $l_1$ Gain Analysis of Boolean Networks With Markovian Jump Parameters. https://app.cochat.ai/papers/10.1109/tac.2017.2679903
- The paper
- Meng, M., Liu, L., & Feng, G. (2017). Stability and $l_1$ Gain Analysis of Boolean Networks With Markovian Jump Parameters. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2017.2679903
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.