CoChat

Minimum-Time Control of Boolean Networks

Laschov, Dmitriy, Margaliot, Michael · 2013 · SIAM Journal on Control and Optimization
Cited by 164

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

Abstract

Boolean networks (BNs) are discrete-time dynamical systems with Boolean state variables. BNs have recently been attracting considerable interest as computational models for biological systems and, in particular, gene regulating networks. Boolean control networks (BCNs) are Boolean networks with Boolean inputs. We consider the problem of steering a BCN from a given state to a desired state in minimal time. Using the algebraic state-space representation (ASSR) of BCNs we derive several necessary conditions, stated in the form of maximum principles (MPs), for a control to be time-optimal. In the ASSR every state and input vector is a canonical vector. Using this special structure yields an explicit state-feedback formula for all time-optimal controls. To demonstrate the theoretical results, we develop a BCN model for the genetic switch controlling the lambda phage development upon infection of a bacteria. Our results suggest that this biological switch is designed in a way that guarantees minimal time response to important environmental signals.

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/110844660

Cites

4 of 4 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.

Metadata

Authors
Laschov, D., & Margaliot, M.
Venue
SIAM Journal on Control and Optimization
Published
2013-01
Volume
51
Issue
4
Pages
2869-2892
ISSN
  • 0363-0129 (ISSN-L)
  • 1095-7138
OpenAlex
W2008275926
Cited by
164
References
4
FWCI
4.57
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: Minimum-Time Control of Boolean Networks. https://app.cochat.ai/papers/10.1137/110844660
The paper
Laschov, D., & Margaliot, M. (2013). Minimum-Time Control of Boolean Networks. SIAM Journal on Control and Optimization. https://doi.org/10.1137/110844660

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.