Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 313

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

Finite-Time Semistability and Consensus for Nonlinear Dynamical Networks

Hui, Qing, Haddad, Wassim M., Bhat, Sanjay P.·2008·IEEE Transactions on Automatic Control

Abstract

This paper focuses on semistability and finite-time stability analysis and synthesis of systems having a continuum of equilibria. Semistability is the property whereby the solutions of a dynamical system converge to Lyapunov stable equilibrium points determined by the system initial conditions. In this paper, we merge the theories of semistability and finite-time stability to develop a rigorous framework for finite-time semistability. In particular, finite-time semistability for a continuum of equilibria of continuous autonomous systems is established. Continuity of the settling-time function as well as Lyapunov and converse Lyapunov theorems for semistability are also developed. In addition, necessary and sufficient conditions for finite-time semistability of homogeneous systems are addressed by exploiting the fact that a homogeneous system is finite-time semistable if and only if it is semistable and has a negative degree of homogeneity. Unlike previous work on homogeneous systems, our results involve homogeneity with respect to semistable dynamics, and require us to adopt a geometric description of homogeneity. Finally, we use these results to develop a general framework for designing semistable protocols in dynamical networks for achieving coordination tasks in finite time.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/tac.2008.929392

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Cited by

See all 313

Metadata

Authors
Hui, Q., Haddad, W. M., & Bhat, S. P.
Venue
IEEE Transactions on Automatic Control
Published
2008-09
Volume
53
Issue
8
Pages
1887-1900
ISSN
0018-9286 (ISSN-L)
OpenAlex
W2167677395
Cited by
313
References
2
FWCI
26.89
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: Finite-Time Semistability and Consensus for Nonlinear Dynamical Networks. https://app.cochat.ai/papers/10.1109/tac.2008.929392
The paper
Hui, Q., Haddad, W. M., & Bhat, S. P. (2008). Finite-Time Semistability and Consensus for Nonlinear Dynamical Networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2008.929392

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.