Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
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
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
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Optimal scheduling using priced timed automata
ACM SIGMETRICS Performance Evaluation Review
Improved undecidability results on weighted timed automata
Information Processing Letters
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
ACM Transactions on Computational Logic (TOCL)
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
Trading Infinite Memory for Uniform Randomness in Timed Games
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
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
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
An accelerated algorithm for 3-color parity games with an application to timed games
CAV'07 Proceedings of the 19th international conference on Computer aided verification
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Testing real-time systems using UPPAAL
Formal methods and testing
Transactions on edutainment I
Expected reachability-time games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
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
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Priced timed automata: algorithms and applications
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
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
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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
The minimal cost reachability problem in priced timed pushdown systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Minimum-time reachability in timed games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Reachability-time games on timed automata
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
Playing games with scenario- and resource-aware SDF graphs through policy iteration
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
ACM Computing Surveys (CSUR)
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.00 |
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.