One-Clock Priced Timed Games are PSPACE-hard

The main result of this paper is that computing the value of a one-clock priced timed game (OCPTG) is PSPACE-hard. Along the way, we provide a family of OCPTGs that have an exponential number of event points. Both results hold even in very restricted classes of games such as DAGs with treewidth three. Finally, we provide a number of positive results, including polynomial-time algorithms for even more restricted classes of OCPTGs such as trees.

[1]  Kim G. Larsen,et al.  Almost Optimal Strategies in One Clock Priced Timed Games , 2006, FSTTCS.

[2]  Marcin Jurdzinski,et al.  Comparing Timed C/E Systems with Timed Automata , 1996 .

[3]  Philippe Schnoebelen,et al.  Model Checking Timed Automata with One or Two Clocks , 2004, CONCUR.

[4]  Benjamin Monmege,et al.  Simple Priced Timed Games are not That Simple , 2015, FSTTCS.

[5]  Rajeev Alur,et al.  Optimal Reachability for Weighted Timed Games , 2004, ICALP.

[6]  Patricia Bouyer,et al.  On the Value Problem in Weighted Timed Games , 2015, CONCUR.

[7]  Patricia Bouyer,et al.  Weighted Timed Automata: Model-Checking and Games , 2006, MFPS.

[8]  Kim G. Larsen,et al.  UPPAAL-Tiga: Time for Playing Games! , 2007, CAV.

[9]  Benjamin Monmege,et al.  Adding Negative Prices to Priced Timed Games , 2014, CONCUR.

[10]  Peter Bro Miltersen,et al.  A Faster Algorithm for Solving One-Clock Priced Timed Games , 2013, CONCUR.

[11]  Supratik Mukhopadhyay,et al.  Optimal-Reachability and Control for Acyclic Weighted Timed Automata , 2002, IFIP TCS.

[12]  Patricia Bouyer,et al.  Improved undecidability results on weighted timed automata , 2006, Inf. Process. Lett..

[13]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[14]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[15]  Vladimir Gurvich,et al.  On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction , 2008, Theory of Computing Systems.

[16]  Kim G. Larsen,et al.  Optimal Strategies in Priced Timed Game Automata , 2004, FSTTCS.

[17]  Véronique Bruyère,et al.  On Optimal Timed Strategies , 2005, FORMATS.

[18]  Ashutosh Trivedi,et al.  Competative optimisation on timed automata , 2009 .

[19]  Véronique Bruyère,et al.  On the optimal reachability problem of weighted timed automata , 2007, Formal Methods Syst. Des..

[20]  Kim G. Larsen,et al.  Synthesis of Optimal Strategies Using HyTech , 2005, GDV@CAV.

[21]  Michal Rutkowski.  Two-Player Reachability-Price Games on Single-Clock Timed Automata , 2011, QAPL.