Almost Optimal Strategies in One Clock Priced Timed Games
From MaRDI portal
Recommendations
Cited in
(18)- Suboptimal universal strategies in an optimum-time game problem
- Time-aware uniformization of winning strategies
- A faster algorithm for solving one-clock priced timed games
- Synthesis of optimal strategies using \textsc{HyTech}
- Model-based verification, optimization, synthesis and performance evaluation of real-time systems
- Model Checking Real-Time Systems
- Time-Dependent Strategies in Games of Timing
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- One-clock priced timed games with negative weights
- Revisiting robustness in priced timed games
- Simple priced timed games are not that simple
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Timed Basic Parallel Processes
- Formal Modeling and Analysis of Timed Systems
- Weighted o-minimal hybrid systems
- Inaproximability in weighted timed games
- Decidability of one-clock weighted timed games with arbitrary weights
- The value problem for weighted timed games with two clocks is undecidable
This page was built for publication: Almost Optimal Strategies in One Clock Priced Timed Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385998)