The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Minimum-Cost Reachability for Priced Time Automata
Abstract
This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them.
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
Alur, R., & Dill, D. L. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90010-8 · Cited by 6,689
Larsen, K. G., Pettersson, P., & Yi, W. (1997) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s100090050010 · Cited by 2,193
Self-citationHenzinger, T. A. (2002) · Proceedings 11th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.1996.561342 · Cited by 1,837
Ordering by Divisibility in Abstract Algebras
Higman, G. (1952) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s3-2.1.326 · Cited by 1,078
Efficient Guiding Towards Cost-Optimality in UPPAAL
Behrmann, G., Fehnker, A., Hune, T. S., Larsen, K. G., Pettersson, P., & Romijn, J. M. T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45319-9_13 · Cited by 141
Self-citationMøller, J., Lichtenberg, J., Andersen, H. R., & Hulgaard, H. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48168-0_9 · Cited by 130
Minimum-Cost Reachability for Priced Timed Automata
Behrmann, G., Fehnker, A., Hune, T. S., et al. (2001) · BRICS Report Series · doi:10.7146/brics.v8i3.20457 · Cited by 69
Self-citationLarsen, K. G., Pearson, J., Weise, C., & Yi, W. (1999) · doi:10.5555/774455.774459 · Cited by 67
Self-citation
Cited by
Linear Time Logic Control of Discrete-Time Linear Systems
Tabuada, P., & Pappas, G. J. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.886494 · Cited by 343
A Time Petri Net Extended with Price Information
LIU, X.-M. (2007) · Journal of Software · doi:10.1360/jos180001 · Cited by 268
Energy-aware device drivers for embedded operating systems
Buschhoff, M., Falkenberg, R., & Spinczyk, O. (2019) · ACM SIGBED Review · doi:10.1145/3373400.3373401 · Cited by 6
Metadata
- Authors
- Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J., & Vaandrager, F.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 147-161
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2065323166
- Cited by
- 303
- References
- 8
- FWCI
- 6.00
- 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: Minimum-Cost Reachability for Priced Time Automata. https://app.cochat.ai/papers/10.1007/3-540-45351-2_15
- The paper
- Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J., & Vaandrager, F. (2001). Minimum-Cost Reachability for Priced Time Automata. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45351-2_15
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.