scientific article; zbMATH DE number 7577581

MaRDI QIDQ5101350

Engel Lefaucheux, Thomas Brihaye, Axel Haddad, Benjamin Monmege, Gilles Geeraerts

Publication date: 30 August 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

game theoryreal-time systemspriced time games

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• 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
• Borel determinacy
• A theory of timed automata
• On the optimal reachability problem of weighted 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
• Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
• Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
• On the synthesis of discrete controllers for timed systems
• One-Clock Priced Timed Games are PSPACE-hard
• Almost Optimal Strategies in One Clock Priced Timed Games
• 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: