The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Uppaal in a nutshell
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Milner, R. (1989) · Cited by 6,877
Automata for modeling real-time systems
Alur, R., & Dill, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0032042 · Cited by 904
UPPAAL — a tool suite for automatic verification of real-time systems
Bengtsson, J. E., Larsen, K. G., Larsson, F., et al. (1996) · Lecture notes in computer science · doi:10.1007/bfb0020949 · Cited by 755
Self-citationAn old-fashioned recipe for real time
Abadi, M., & Lamport, L. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/186025.186058 · Cited by 240
Efficient verification of real-time systems: compact data structure and state-space reduction
Larsen, K. G., Larsson, F., Pettersson, P., & Yi, W. (2002) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1997.641265 · Cited by 184
Self-citation
Cited by
PRISM 4.0: Verification of Probabilistic Real-Time Systems
Kwiatkowska, M., Norman, G., & Parker, D. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22110-1_47 · Cited by 2,361
Visser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
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
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
Computational techniques for the verification of hybrid systems
Tomlin, C. J., Mitchell, I., Bayen, A. M., & Oishi, M. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.814621 · Cited by 353
Metadata
- Authors
- Larsen, K. G., Pettersson, P., & Yi, W.
- Venue
- International Journal on Software Tools for Technology Transfer
- Published
- 1997-12
- Volume
- 1
- Issue
- 1-2
- Pages
- 134-152
- ISSN
- 1433-2779 (ISSN-L)
- OpenAlex
- W2000947342
- Cited by
- 2,193
- References
- 6
- FWCI
- 39.49
- 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.