The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Linear Time Logic Control of Discrete-Time Linear Systems
Abstract
The control of complex systems poses new challenges that fall beyond the traditional methods of control theory. One of these challenges is given by the need to control, coordinate and synchronize the operation of several interacting submodules within a system. The desired objectives are no longer captured by usual control specifications such as stabilization or output regulation. Instead, we consider specifications given by linear temporal logic (LTL) formulas. We show that existence of controllers for discrete-time controllable linear systems and LTL specifications can be decided and that such controllers can be effectively computed. The closed-loop system is of hybrid nature, combining the original continuous dynamics with the automatically synthesized switching logic required to enforce the specification
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
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Milner, R. (1989) · Cited by 6,877
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
Clarke, E. M., Grümberg, O., & Long, D. (1996) · Cited by 6,813
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
Penczek, W. (1990) · Science of Computer Programming · doi:10.1016/0167-6423(90)90076-p · Cited by 3,954
Introduction to Discrete Event Systems
Cassandras, C. G., & Lafortune, S. (2021) · Springer eBooks · doi:10.1007/978-3-030-72274-6 · Cited by 3,342
The Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
The control of discrete event systems
Ramadge, P. J. G., & Wonham, W. M. (1989) · Proceedings of the IEEE · doi:10.1109/5.21072 · Cited by 2,937
Clarke, E., McMillan, K., Campos, S., & Hartonas-Garmhausen, V. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_93 · Cited by 2,839
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
Introduction to Discrete Event Systems
Cassandras, C. G., & Lafortune, S. (1999) · The Kluwer International Series on Discrete Event Dynamic Systems · doi:10.1007/978-1-4757-4070-7 · Cited by 1,699
Stabilization of linear systems with limited information
Elia, N., & Mitter, S. K. (2001) · IEEE Transactions on Automatic Control · doi:10.1109/9.948466 · Cited by 1,687
McMillan, K. L. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3190-6 · Cited by 1,677
Quantized feedback stabilization of linear systems
Brockett, R. W., & Liberzon, D. (2000) · IEEE Transactions on Automatic Control · doi:10.1109/9.867021 · Cited by 1,636
Bochnak, J., Coste, M., & Roy, M.-F. (1998) · Springer · doi:10.1007/978-3-662-03718-8 · Cited by 1,538 · cited 1×
“…following elementary sets: Computability of the finite bisimulation is now a consequence of effective computability of intersections, unions and complements of semi-linear sets and the fact that Pre of a semi-linear set can be computed by quantifier elimination [59], resulting in a semi-linear set.”
BackgroundThe Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
On a Decision Method in Restricted Second Order Arithmetic
Büchi, J. R. (1990) · The Collected Works of J. Richard Büchi · doi:10.1007/978-1-4613-8928-6_23 · Cited by 1,271
(2014) · Choice Reviews Online · doi:10.5860/choice.51-3296 · Cited by 1,260
Discrete abstractions of hybrid systems
Alur, R., Henzinger, T. A., Lafferriere, G., & Pappas, G. J. (2000) · Proceedings of the IEEE · doi:10.1109/5.871304 · Cited by 801
Self-citationSimple On-the-fly Automatic Verification of Linear Temporal Logic
Gerth, R., Peled, D., Vardi, M. Y., & Wolper, P. (1996) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-34892-6_1 · Cited by 705
Using branching time temporal logic to synthesize synchronization skeletons
Emerson, E. A., & Clarke, E. M. (1982) · Science of Computer Programming · doi:10.1016/0167-6423(83)90017-5 · Cited by 660
What's Decidable about Hybrid Automata?
Henzinger, T. A., Kopke, P. W., Puri, A., & Varaiya, P. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1581 · Cited by 660
Synthesis of Communicating Processes from Temporal Logic Specifications
Manna, Z., & Wolper, P. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357233.357237 · Cited by 497
Characterizing finite Kripke structures in propositional temporal logic
Browne, M. C., Clarke, E. M., & Grümberg, O. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90098-9 · Cited by 419
Minimum-Cost Reachability for Priced Time Automata
Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J., & Vaandrager, F. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45351-2_15 · Cited by 303
Lafferriere, G., Pappas, G. J., & Sastry, S. (2000) · Mathematics of Control Signals and Systems · doi:10.1007/pl00009858 · Cited by 274
Self-citationOptimal Paths in Weighted Timed Automata
Alur, R., La Torre, S., & Pappas, G. J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45351-2_8 · Cited by 208
Self-citationChallenges and opportunities in automotive transmission control
Sun, Z., & Hebbale, K. (2005) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2005.1470477 · Cited by 135
Self-assembly for microscale and nanoscale packaging: steps toward self-packaging
Morris, C. J., Stauth, S. A., & Parviz, B. A. (2005) · IEEE Transactions on Advanced Packaging · doi:10.1109/tadvp.2005.858454 · Cited by 114
Dario, P., Carrozza, M. C., Guglielmelli, E., Laschi, C., Menciassi, A., Micera, S., & Vecchi, F. (2005) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2005.1458320 · Cited by 73
Military robots - a glimpse from today and tomorrow
Khurshid, J., & Hong, B. (2005) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv.2004.1468925 · Cited by 60
The Control of Synchronous Systems
de Alfaro, L., Henzinger, T. A., & Mang, F. Y. C. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44618-4_33 · Cited by 40
The Control of Synchronous Systems, Part II
de Alfaro, L., Henzinger, T. A., & Mang, F. Y. C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44685-0_38 · Cited by 26
Aircraft in the future ATM system - exploiting the 4D aircraft trajectory
Teutsch, J., & Hoffman, E. G. (2005) · IEEE/AIAA Digital Avionics Systems Conference (DASC) · doi:10.1109/dasc.2004.1391291 · Cited by 17
Cited by
Cyber–Physical Systems: A Perspective at the Centennial
Kim, K.-D., & Kumar, P. R. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2189792 · Cited by 761
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
Self-citationReceding 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
Connected and Automated Vehicles
Peng, H. (2016) · Mechanical Engineering · doi:10.1115/1.2016-dec-2 · Cited by 15
Metadata
- Authors
- Tabuada, P., & Pappas, G. J.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2006-12
- Volume
- 51
- Issue
- 12
- Pages
- 1862-1877
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2044323243
- Cited by
- 343
- References
- 37
- FWCI
- 15.03
- 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
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.