The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Robustness of temporal logic specifications for continuous-time signals
Open accessAbstract
In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas over signals that take values in metric spaces. For such signals, which are generated by systems whose states are equipped with non-trivial metrics, for example continuous or hybrid, robustness is not only natural, but also a critical measure of system performance. Thus, we propose multi-valued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, @e, from unsatisfiability. We prove that any other signal that remains @e-close to the initial one also satisfies the same MTL specification under the usual Boolean semantics. Finally, our framework is applied to the problem of testing formulas of two fragments of MTL, namely Metric Interval Temporal Logic (MITL) and closed Metric Temporal Logic (clMTL), over continuous-time signals using only discrete-time analysis. The motivating idea behind our approach is that if the continuous-time signal fulfills certain conditions and the discrete-time signal robustly satisfies the temporal logic specification, then the corresponding continuous-time signal should also satisfy the same temporal logic 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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
Ogata, K., & Brewer, J. W. (1971) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.3426465 · Cited by 6,358
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Introduction to Lattices and Order
Davey, B. A., & Priestley, H. A. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809088 · Cited by 4,901
Clarke, E. M., & Schlingloff, B. (1999) · Cited by 4,226
Linear system theory and design
Barnett, S. M. (1986) · Automatica · doi:10.1016/0005-1098(86)90039-7 · Cited by 3,677
Linear System Theory and Design
Chen, C. (1995) · Medical Entomology and Zoology · Cited by 3,047
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
Cited by
Robust Satisfaction of Temporal Logic over Real-Valued Signals
Donzé, A., & Maler, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15297-9_9 · Cited by 717
S-TaLiRo: A Tool for Temporal Logic Falsification for Hybrid Systems
Annpureddy, Y., Liu, C., Fainekos, G., & Sankaranarayanan, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19835-9_21 · Cited by 428
Self-citationSpecification-Based Monitoring of Cyber-Physical Systems: A Survey on Theory, Tools and Applications
Bartocci, E., Deshmukh, J., Donzé, A., Fainekos, G., Maler, O., Ničković, D., & Sankaranarayanan, S. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-75632-5_5 · Cited by 316
Self-citationRequirements-driven test generation for autonomous vehicles with machine learning components
Tuncali, C. E., Fainekos, G., Prokhorov, D., Ito, H., & Kapinski, J. (2020) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2019.2955903 · Cited by 129
Self-citationPower Line Inspection Tasks With Multi-Aerial Robot Systems Via Signal Temporal Logic Specifications
Silano, G., Baca, T., Penicka, R., Liuzza, D., & Saska, M. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3068114 · Cited by 58
Metadata
- Authors
- Fainekos, G. E., & Pappas, G. J.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2009-09
- Volume
- 410
- Issue
- 42
- Pages
- 4262-4291
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2049399166
- Cited by
- 598
- References
- 25
- FWCI
- 8.69
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Robustness of temporal logic specifications for continuous-time signals. https://app.cochat.ai/papers/10.1016/j.tcs.2009.06.021
- The paper
- Fainekos, G. E., & Pappas, G. J. (2009). Robustness of temporal logic specifications for continuous-time signals. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2009.06.021
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.