A Faster Algorithm for Solving One-Clock Priced Timed Games

DOI10.1007/978-3-642-40184-8_37zbMath1390.68387arXiv1201.3498OpenAlexW1641860851MaRDI QIDQ2842131

Peter Bro Miltersen, Rasmus Ibsen-Jensen, Thomas Dueholm Hansen

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Formal languages and automata (68Q45)

Related Items (8)

Model Checking Real-Time Systems ⋮ Optimal controller synthesis for timed systems ⋮ Unnamed Item ⋮ Optimal Reachability in Divergent Weighted Timed Games ⋮ Timed Basic Parallel Processes ⋮ Unnamed Item ⋮ Symbolic Approximation of Weighted Timed Games ⋮ Timed network games

This page was built for publication: A Faster Algorithm for Solving One-Clock Priced Timed Games