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

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

Strict Lyapunov Functions for the Super-Twisting Algorithm

Moreno, J. A., Osorio, M.·2012·IEEE Transactions on Automatic Control

Abstract

A method to construct a family of strict Lyapunov functions, i.e., with negative definite derivative, for the super-twisting algorithm, without or with perturbations, is provided. This second order sliding modes algorithm is widely used to design controllers, observers and exact differentiators. The proposed Lyapunov functions ascertain finite time convergence, provide an estimate of the convergence time, and ensure the robustness of the finite-time or ultimate boundedness for a class of perturbations wider than the classical ones for this algorithm. Since the Lyapunov functions and their derivatives are quadratic forms, the operation with them is as simple as for linear time invariant systems.

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

Cites

14 of 14 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 14 references

Cited by

See all 1,377

Metadata

Authors
Moreno, J. A., & Osorio, M.
Venue
IEEE Transactions on Automatic Control
Published
2012-04
Volume
57
Issue
4
Pages
1035-1040
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2031945217
Cited by
1,377
References
14
FWCI
69.54
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: Strict Lyapunov Functions for the Super-Twisting Algorithm. https://app.cochat.ai/papers/10.1109/tac.2012.2186179
The paper
Moreno, J. A., & Osorio, M. (2012). Strict Lyapunov Functions for the Super-Twisting Algorithm. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2012.2186179

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.