Optimal Reachability in Divergent Weighted Timed Games

DOI10.1007/978-3-662-54458-7_10zbMath1486.68092arXiv1701.03716OpenAlexW2575538450MaRDI QIDQ2988366

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

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Formal languages and automata (68Q45)

Related Items (5)

Unnamed Item ⋮ Optimal controller synthesis for timed systems ⋮ Optimal Reachability in Divergent Weighted Timed Games ⋮ Unnamed Item ⋮ Symbolic Approximation of Weighted Timed Games

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
• On short paths interdiction problems: Total and node-wise limited interdiction
• The method of forced enumeration for nondeterministic automata
• Number of quantifiers is better than number of tape cells
• A theory of timed automata
• Dynamical properties 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
• Nondeterministic Space is Closed under Complementation
• 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: Optimal Reachability in Divergent Weighted Timed Games