Specifying real-time properties with metric temporal logic
Real-Time Systems
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Better is Better than Well: On Efficient Verification of Infinite-State Systems
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
ACM Transactions on Computational Logic (TOCL)
On model-checking timed automata with stopwatch observers
Information and Computation
Improved undecidability results on weighted timed automata
Information Processing Letters
Model-checking one-clock priced timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Almost optimal strategies in one clock priced timed games
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Optimal conditional reachability for multi-priced timed automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Infinite Runs in Weighted Timed Automata with Energy Constraints
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Supports of Recognizable Timed Series
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
MSO logics for weighted timed automata
Formal Methods in System Design
On the interval-bound problem for weighted timed automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
| Hi-index | 0.02 |
We study the model-checking problem for WMTL, a cost-extension of the linear-time timed temporal logic MTL, that is interpreted over weighted timed automata. We draw a complete picture of the decidability for that problem: it is decidable only for the class of one-clock weighted timed automata with a restricted stopwatch cost, and any slight extension of this model leads to undecidability. We finally give some consequences on the undecidability of linear hybrid automata.