Symbolic Approximation of Weighted Timed Games
From MaRDI portal
Publication:5090965
Recommendations
Cites work
- scientific article; zbMATH DE number 1303059 (Why is no real title available?)
- scientific article; zbMATH DE number 1794367 (Why is no real title available?)
- A faster algorithm for solving one-clock priced timed games
- A theory of timed automata
- Adding negative prices to priced timed games
- Automata, Languages and Programming
- Energy and mean-payoff timed games
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Formal Modeling and Analysis of Timed Systems
- Improved undecidability results on weighted timed automata
- On the Value Problem in Weighted Timed Games.
- On the optimal reachability problem of weighted timed automata
- Optimal infinite scheduling for multi-priced timed automata
- Optimal paths in weighted timed automata
- Optimal reachability in divergent weighted timed games
- 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
(2)
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)