Theoretical Computer Science
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal-Reachability and Control for Acyclic Weighted Timed Automata
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Computation: finite and infinite machines
Computation: finite and infinite machines
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Improved undecidability results on weighted timed automata
Information Processing Letters
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
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
Automatic Synthesis of Robust and Optimal Controllers --- An Industrial Case Study
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
On the Supports of Recognizable Timed Series
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Weighted Timed Automata: Model-Checking and Games
Electronic Notes in Theoretical Computer Science (ENTCS)
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
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Expected reachability-time games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Quantitative analysis of real-time systems using priced timed automata
Communications of the ACM
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
Timed alternating-time temporal logic
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Verification, performance analysis and controller synthesis for real-time systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Nash equilibrium in weighted concurrent timed games with reachability objectives
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Minimum-time reachability in timed games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Controllers with minimal observation power (application to timed systems)
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
A faster algorithm for solving one-clock priced timed games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Robust weighted timed automata and games
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.02 |
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a strategy to force the game into T with a cost less than C no matter how Player 2 behaves. Recently, this problem has been studied independently by Alur et al and by Bouyer et al. In those two works, a semi-algorithm is proposed to solve the reachability problem, which is proved to terminate under a condition imposing the non-zenoness of cost. In this paper, we show that in the general case the existence of a strategy for Player 1 to win the game with a bounded cost is undecidable. Our undecidability result holds for weighted timed game automata with five clocks. On the positive side, we show that if we restrict the number of clocks to one and we limit the form of the cost on locations, then the semi-algorithm proposed by Bouyer et al always terminates.