Symbolic Approximation of Weighted Timed Games
From MaRDI portal
Recommendations
Cites work
- A faster algorithm for solving one-clock priced timed games
- A theory of timed automata
- Adding negative prices to priced timed games
- As soon as possible: Time optimal control for timed automata
- Energy and mean-payoff timed games
- Formal Modeling and Analysis of Timed Systems
- Improved undecidability results on weighted timed automata
- Minimum-cost reachability for priced timed automata
- On the optimal reachability problem of weighted timed automata
- On the Value Problem in Weighted Timed Games.
- Optimal infinite scheduling for multi-priced timed automata
- Optimal paths in weighted timed automata
- Optimal reachability for weighted timed games
- Optimal reachability in divergent weighted timed games
- Optimal strategies in priced timed game automata
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
- Reachability-Time Games on Timed Automata
- Simple priced timed games are not that simple
- Two-player reachability-price games on single-clock timed automata
Cited in
(8)- On the Value Problem in Weighted Timed Games.
- Optimal controller synthesis for timed systems
- Inaproximability in weighted timed games
- Playing stochastically in weighted timed games to emulate memory
- Decidability of one-clock weighted timed games with arbitrary weights
- Synthesis of robust optimal real-time systems
- Playing stochastically in weighted timed games to emulate memory
- Deciding the value of two-clock almost non-Zeno weighted timed games
This page was built for publication: Symbolic Approximation of Weighted Timed Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090965)