The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
Abstract
We consider the following problem: given a linear system and a linear temporal logic (LTL) formula over a set of linear predicates in its state variables, find a feedback control law with polyhedral bounds and a set of initial states so that all trajectories of the closed loop system satisfy the formula. Our solution to this problem consists of three main steps. First, we partition the state space in accordance with the predicates in the formula, and construct a transition system over the partition quotient, which captures our capability of designing controllers. Second, using a procedure resembling model checking, we determine runs of the transition system satisfying the formula. Third, we generate the control strategy. Illustrative examples are included.
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.
Integrity signals
Registry
Cites
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.
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 note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Alur, R., & Dill, D. L. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90010-8 · Cited by 6,689
Clarke, E. M., & Schlingloff, B. (1999) · Cited by 4,226
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
Ziegler, G. M. (1995) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-8431-1 · Cited by 2,329
Spin model checker, the: primer and reference manual
Holzmann, G. J. (2003) · Cited by 2,009
Introduction to algorithms [2nd ed.]
Cormen, T. H. (2001) · Cited by 1,911
The algorithmic analysis of hybrid systems
Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., & Yovine, S. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00202-t · Cited by 1,876
Handbook of discrete and computational geometry
(1998) · Choice Reviews Online · doi:10.5860/choice.35-5707b · Cited by 1,456
Contributions to the Theory of Games
Rubin, H., Kuhn, H. W., & Tucker, A. W. (1952) · Econometrica · doi:10.2307/1907817 · Cited by 1,198
Cited by
Temporal-Logic-Based Reactive Mission and Motion Planning
Kress-Gazit, H., Fainekos, G. E., & Pappas, G. J. (2009) · IEEE Transactions on Robotics · doi:10.1109/tro.2009.2030225 · Cited by 750
Receding Horizon Temporal Logic Planning
Wongpiromsarn, T., Topcu, U., & Murray, R. M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2195811 · Cited by 292
Formal Methods for Autonomous Systems
Wongpiromsarn, T., Ghasemi, M., Cubuktepe, M., Bakirtzis, G., Carr, S., Karabag, M. O., Neary, C., Gohari, P., & Topcu, U. (2023) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000029 · Cited by 17
Metadata
- Authors
- Kloetzer, M., & Belta, C.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2008-02
- Volume
- 53
- Issue
- 1
- Pages
- 287-297
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2150335178
- Cited by
- 514
- References
- 24
- FWCI
- 34.40
- 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: A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications. https://app.cochat.ai/papers/10.1109/tac.2007.914952
- The paper
- Kloetzer, M., & Belta, C. (2008). A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2007.914952
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.