Symbolic Approximation of Weighted Timed Games

DOI10.4230/LIPIcs.FSTTCS.2018.28OpenAlexW2963757936MaRDI QIDQ5090965

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

Publication date: 21 July 2022

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

zbMATH Keywords

game theoryapproximationreal-time systemsweighted timed games

Mathematics Subject Classification ID

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

Related Items (1)

Optimal controller synthesis for timed systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
• Optimal paths in weighted timed automata
• Improved undecidability results on weighted timed automata
• A theory of timed automata
• On the optimal reachability problem of weighted timed automata
• Optimal infinite scheduling for multi-priced timed automata
• A Faster Algorithm for Solving One-Clock Priced Timed Games
• Energy and mean-payoff timed games
• Optimal Reachability in Divergent Weighted Timed Games
• Adding Negative Prices to Priced Timed Games
• On the Value Problem in Weighted Timed Games.
• Reachability-Time Games on Timed Automata
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automata, Languages and Programming
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Symbolic Approximation of Weighted Timed Games