The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Model-checking for real-time systems
Abstract
This research extends CTL model-checking to the analysis of real-time systems, whose correctness depends on the magnitudes of the timing delays. For specifications, the syntax of CTL is extended to allow quantitative temporal operators. The formulas of the resulting logic, TCTL, are interpretation over continuous computation trees, trees in which paths are maps from the set of nonnegative reals to system states. To model finite-state systems the notion of timed graphs is introduced-state-transition graphs extended with a mechanism that allows the expression of constant bounds on the delays between the state transition. As the main result, an algorithm is developed for model checking, that is, for determining the truth of a TCTL formula with respect to a timed graph. It is argued that choosing a dense domain, instead of a discrete domain, to model time does not blow up the complexity of the model-checking problem. On the negative side, it is shown that the denseness of the underlying time domain makes TCTL II/sub 1//sup 1/-hard. The question of deciding whether a given TCTL formula is implementable by a timed graph is also undecidable.>
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
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
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
Automatic 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
Automata for modeling real-time systems
Alur, R., & Dill, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0032042 · Cited by 904
Self-citationUsing 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
Safety analysis of timing properties in real-time systems
Jahanian, F., & Mok, A. K.-L. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6313045 · Cited by 628
Proving Liveness Properties of Concurrent Programs
Owicki, S., & Lamport, L. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357178 · Cited by 576
Alur, R., & Henzinger, T. A. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63473 · Cited by 162
Self-citation
Cited by
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
Self-citationThe synchronous data flow programming language LUSTRE
Halbwachs, N., Caspi, P., Raymond, P., & Pilaud, D. (1991) · Proceedings of the IEEE · doi:10.1109/5.97300 · Cited by 1,590
A logic for reasoning about time and reliability
Hansson, H., & Jonsson, B. (1994) · Formal Aspects of Computing · doi:10.1007/bf01211866 · Cited by 1,372
Principles and methods of testing finite state machines-a survey
Lee, D., & Yannakakis, M. (1996) · Proceedings of the IEEE · doi:10.1109/5.533956 · Cited by 1,228
Automata for modeling real-time systems
Alur, R., & Dill, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0032042 · Cited by 904
Self-citation
Metadata
- Authors
- Alur, R., Courcoubetis, C., & Dill, D.
- Venue
- [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-04
- Pages
- 414-425
- ISSN
- 1043-6871 (ISSN-L)
- OpenAlex
- W2153439859
- Cited by
- 897
- References
- 8
- FWCI
- 50.99
- Type
- conference paper
- 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: Model-checking for real-time systems. https://app.cochat.ai/papers/10.1109/lics.1990.113766
- The paper
- Alur, R., Courcoubetis, C., & Dill, D. (2002). Model-checking for real-time systems. [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science. https://doi.org/10.1109/lics.1990.113766
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.