“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Scheduling with timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Efficient timed model checking for discrete-time systems
Theoretical Computer Science
Improved undecidability results on weighted timed automata
Information Processing Letters
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
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
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
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
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)
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A Kleene-Schützenberger theorem for weighted timed automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions. We prove that model-checking this class of models against the logic WCTL, CTL with cost-constrained modalities, is PSPACE-complete under the "single-clock" assumption. In contrast, it has been recently proved that the model-checking problem is undecidable for this model as soon as the system has three clocks. We also prove that the model-checking of WCTL* becomes undecidable, even under this "single-clock" assumption.