Almost optimal strategies in one clock priced timed games

Authors:
Patricia Bouyer;Kim G. Larsen;Nicolas Markey;Jacob Illum Rasmussen
Affiliations:
Lab. Spécification & Vérification, CNRS & ENS Cachan, France;Department of Computer Science, Aalborg University, Denmark;Lab. Spécification & Vérification, CNRS & ENS Cachan, France;Department of Computer Science, Aalborg University, Denmark
Venue:
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2006

Citing 11
Cited 9

A theory of timed automata

Theoretical Computer Science
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
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Computing Accumulated Delays in Real-time Systems

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Optimal infinite scheduling for multi-priced timed automata

Formal Methods in System Design
Improved undecidability results on weighted timed automata

Information Processing Letters
On optimal timed strategies

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
Timed automata with observers under energy constraints

Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Model-checking one-clock priced timed automata

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Costs are expensive!

FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Quantitative analysis of real-time systems using priced timed automata

Communications of the ACM
Verification, performance analysis and controller synthesis for real-time systems

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Reachability-time games on timed automata

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A faster algorithm for solving one-clock priced timed games

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.02

Visualization

Abstract

We consider timed games extended with cost information, and prove computability of the optimal cost and of ε-optimal memoryless strategies in timed games with one clock. In contrast, this problem has recently been proved undecidable for timed games with three clocks.