The DOI matches its Crossref record.
Reachability Checking of Finite Precision Timed Automata
Abstract
Abstract: To relieve the state space explosion problem, and accelerate the speed of model checking, this paper introduces the concept of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. FPTAs only record the integer values of clock variables together with the order of their most recent resets to reduce the state space. The constraints under which the reachability checking of a timed automaton can be reduced to that of the corresponding FPTA are provided, and then an algorithm for reachability analysis is presented. Finally, the paper presents some preliminary experimental results, and analyzes the advantages and disadvantages of the new data structure. Key words: finite precision timed automata; symbolic method; model checking; reachability 摘 要: 为了缓解状态空间爆炸问题,减小模型检测过程中生成的状态空间,加快模型检测速度,引入有限精度 时间自动机(finite precision timed automata,简 称 FPTA)作为实时系统的形式模 型,并提出了一种数据结构
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
Cited by
An atlas of active enhancers across human cell types and tissues
The FANTOM Consortium, Andersson, R., Gebhard, C., Miguel-Escalada, I., Hoof, I., Bornholdt, J., Boyd, M., Chen, Y., Zhao, X., Schmidl, C., et al. (2014) · Nature · doi:10.1038/nature12787 · Cited by 2,550
Plant height and hydraulic vulnerability to drought and cold
Olson, M. E., Soriano, D., Rosell, J. A., Anfodillo, T., Donoghue, M. J., Edwards, E. J., León-Gómez, C., Dawson, T., Camarero Martínez, J. J., Castorena, M., et al. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1721728115 · Cited by 434
How predictable are symptoms in psychopathological networks? A reanalysis of 18 published datasets
Haslbeck, J. M. B., & Fried, E. I. (2017) · Psychological Medicine · doi:10.1017/s0033291717001258 · Cited by 429
An Introduction to Item Response Theory for Patient-Reported Outcome Measurement
Nguyen, T. H., Han, H.-R., Kim, M. T., & Chan, K. S. (2014) · The Patient - Patient-Centered Outcomes Research · doi:10.1007/s40271-013-0041-0 · Cited by 421
Food sharing in vampire bats: reciprocal help predicts donations more than relatedness or harassment
Carter, G. G., & Wilkinson, G. S. (2013) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2012.2573 · Cited by 404
Metadata
- Authors
- YAN, R.-J.
- Venue
- Journal of Software
- Published
- 2006
- Volume
- 17
- Issue
- 1
- Pages
- 1
- ISSN
- 1000-9825 (ISSN-L)
- OpenAlex
- W2122077176
- Cited by
- 218
- References
- 0
- FWCI
- 1.71
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reachability Checking of Finite Precision Timed Automata. https://app.cochat.ai/papers/10.1360/jos170001
- The paper
- YAN, R.-J. (2006). Reachability Checking of Finite Precision Timed Automata. Journal of Software. https://doi.org/10.1360/jos170001
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.
