CoChat

On Controllability of Delayed Boolean Control Networks

Open access
Lu, Jianquan, Zhong, Jie, Ho, Daniel W. C., Tang, Yang, Cao, Jinde · 2016 · SIAM Journal on Control and Optimization
Cited by 188

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

This paper is devoted to studying the trajectory and state controllability of Boolean control networks (BCNs) with time delay. In contrast to BCNs without time delay, the dynamics of delayed BCNs are determined by a sequence of initial states, named here trajectories. Trajectory controllability means that there exists a control signal steering a system from an initial trajectory to a desired trajectory, while state controllability means that there exists a control signal steering an initial state to a given state. Here, both trajectory controllability and state controllability will be studied. It should be noted that in this paper, trajectory controllability does not mean tracking or following a given trajectory. In fact it means to control BCNs to a destination trajectory of length $\mu$ at the $k$-th step. Using the semi-tensor product of matrices, the delayed BCNs are first converted into an equivalent algebraic description, and then some necessary and sufficient conditions are derived for the trajectory controllability of delayed BCNs. We further present a bijection between the state of BCNs and the trajectory of length $\mu$, which is then used to derive some necessary and sufficient conditions for the state controllability of delayed BCNs. Both the problems of controlling an initial state sequence to a desired state and a desired trajectory are first investigated. We also consider the issues of avoiding some specific states which may cause diseases or lead to dangerous situations. Numerical examples are given to illustrate our theoretical 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.

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

Integrity signals

Registry

Crossref · 10.1137/140991820

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

Metadata

Authors
Lu, J., Zhong, J., Ho, D. W. C., Tang, Y., & Cao, J.
Venue
SIAM Journal on Control and Optimization
Published
2016-01
Volume
54
Issue
2
Pages
475-494
ISSN
  • 0363-0129 (ISSN-L)
  • 1095-7138
OpenAlex
W2290618319
Cited by
188
References
2
FWCI
32.83
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.