The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The benefits of relaxing punctuality
Open accessAbstract
The most natural, compositional, way of modeling real-time systems uses a dense domain for time.The satistiability of timing constraints that are capable of expressing punctuality in this model, however, is known to be undecidable.We introduce a temporal language that can constrain the time difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXPSPACE-complete.This result allows us to develop an algorithm for the verification of timing properties of real-time systems with a dense semantics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Alur, R., & Dill, D. L. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90010-8 · Cited by 6,689
Self-citationAutomatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
Specifying real-time properties with metric temporal logic
Koymans, R. (1990) · Real-Time Systems · doi:10.1007/bf01995674 · Cited by 1,180
The complexity of propositional linear temporal logics
Sistla, A. P., & Clarke, E. M. (1985) · Journal of the ACM · doi:10.1145/3828.3837 · Cited by 1,095
Checking that finite state concurrent programs satisfy their linear specification
Lichtenstein, O., & Pnueli, A. (1985) · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · doi:10.1145/318593.318622 · Cited by 621
Propositional dynamic logic of nonregular programs
Harel, D., Pnueli, A., & Stavi, J. (1983) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(83)90014-4 · Cited by 96
Cited by
Monitoring Temporal Properties of Continuous Signals
Maler, O., & Nickovic, D. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30206-3_12 · Cited by 1,227
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
Robustness of temporal logic specifications for continuous-time signals
Fainekos, G. E., & Pappas, G. J. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.06.021 · Cited by 598
Logics and models of real time: A survey
Alur, R., & Henzinger, T. A. (1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0031988 · Cited by 548
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
Planning for temporally extended goals
Bacchus, F., & Kabanza, F. (1998) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018985923441 · Cited by 276
Combining Induction, Deduction, and Structure for Verification and Synthesis
Seshia, S. A. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2471838 · Cited by 38
Metadata
- Authors
- Alur, R., Feder, T., & Henzinger, T. A.
- Venue
- Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91
- Publisher
- ACM Press
- Published
- 1991
- Volume
- 43
- Issue
- 1
- Pages
- 139-152
- OpenAlex
- W1541805310
- Cited by
- 679
- References
- 7
- FWCI
- 7.55
- Type
- conference paper
- 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
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.