Symbolic Approximation of Weighted Timed Games

DOI10.4230/LIPICS.FSTTCS.2018.28OpenAlexW2963757936MaRDI QIDQ5090965FDOQ5090965

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

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)

Cites Work

• A theory of timed automata
• Optimal Reachability in Divergent Weighted Timed Games
• Title not available (Why is that?)
• 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
• Improved undecidability results on weighted timed automata
• Optimal paths in weighted timed automata
• On the optimal reachability problem of weighted timed automata
• Title not available (Why is that?)
• Optimal infinite scheduling for multi-priced timed automata
• Adding Negative Prices to Priced Timed Games
• Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
• Title not available (Why is that?)
• A faster algorithm for solving one-clock priced timed games
• Energy and mean-payoff timed games
• On the Value Problem in Weighted Timed Games.
• Title not available (Why is that?)

Cited In (2)

• On the Value Problem in Weighted Timed Games.
• Optimal controller synthesis for timed systems

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)