Cited By
View all- Arcile JAndré É(2022)Timed Automata as a Formalism for Expressing Security: A Survey on Theory and PracticeACM Computing Surveys10.1145/353496755:6(1-36)Online publication date: 19-May-2022
SMT-based Searching for k-quasi-optimal Runs in Weighted Timed Automata
Abstract
We investigate a quasi-optimal cost reachability problem for weighted timed automata. We use a translation to the satisfiability modulo theories (SMT) problem to solve the problem. In particular, we show how to find a run of length k ∈ IN that starts at the initial state and terminates at a state containing the target location, its total cost belongs to the interval [c; c + 1), for some natural number c ∈ IN, and the cost of each other run of length k, which also leads from the initial state to a state containing the target location, is greater or equal to c. This kind of run is called k-quasi-optimal. We exemplify the use of our solution to the investigated problem by means of the weighted timed generic pipeline protocol and the weighted job shop scheduling problem, and we provide some preliminary experimental results.
Index Terms
- SMT-based Searching for k-quasi-optimal Runs in Weighted Timed Automata*
Index terms have been assigned to the content through auto-classification.
Recommendations
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Lower-bound-constrained runs in weighted timed automata
We investigate a number of problems related to infinite runs of weighted timed automata (with a single weight variable), subject to lower-bound constraints on the accumulated weight. Closing an open problem from Bouyer et al. (2008), we show that the ...
Lower-Bound Constrained Runs in Weighted Timed Automata
QEST '12: Proceedings of the 2012 Ninth International Conference on Quantitative Evaluation of SystemsWe investigate a number of problems related to infinite runs of weighted timed automata, subject to lower-bound constraints on the accumulated weight. Closing an open problem from an earlier paper, we show that the existence of an infinite lower-bound-...
Comments
Information & Contributors
Information
Published In
IOS Press and the authors. All rights reserved.
Publisher
IOS Press
Netherlands
Publication History
Published: 01 January 2017
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Feb 2025
Other Metrics
Citations
Cited By
View all- Arcile JAndré É(2022)Timed Automata as a Formalism for Expressing Security: A Survey on Theory and PracticeACM Computing Surveys10.1145/353496755:6(1-36)Online publication date: 19-May-2022