Decidability of one-clock weighted timed games with arbitrary weights
From MaRDI portal
Cites work
- A faster algorithm for solving one-clock priced timed games
- A lattice-theoretical fixpoint theorem and its applications
- A theory of timed automata
- Algorithms in real algebraic geometry
- Almost Optimal Strategies in One Clock Priced Timed Games
- Automata, Languages and Programming
- CONCUR 2004 - Concurrency Theory
- Decidability of one-clock weighted timed games with arbitrary weights
- Formal Modeling and Analysis of Timed Systems
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 1303059 (Why is no real title available?)
- scientific article; zbMATH DE number 1337733 (Why is no real title available?)
- scientific article; zbMATH DE number 1794367 (Why is no real title available?)
- One-Clock Priced Timed Games are PSPACE-hard
- One-clock priced timed games with negative weights
- Optimal reachability in divergent weighted timed games
- Reachability-Time Games on Timed Automata
- Simple priced timed games are not that simple
- Symbolic Approximation of Weighted Timed Games
- Two-player reachability-price games on single-clock timed automata
This page was built for publication: Decidability of one-clock weighted timed games with arbitrary weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034350)