Symbolic Approximation of Weighted Timed Games

DOI10.4230/LIPICS.FSTTCS.2018.28MaRDI QIDQ5090965zbMATH OpenOpenAlexFDO

Authors Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1812.01062

zbMATH Keywords

approximationgame theoryreal-time systemsweighted timed games

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Recommendations

• On the Value Problem in Weighted Timed Games.
• Optimal controller synthesis for timed systems
• Optimal reachability in divergent weighted timed games
• One-clock priced timed games with negative weights

Cites work

• 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
• Formal Modeling and Analysis of Timed Systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 1303059 (Why is no real title available?)
• scientific article; zbMATH DE number 1794367 (Why is no real title available?)
• Improved undecidability results on weighted 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 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

(7)

• 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

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)