Average-Time Games on Timed Automata

An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taking turns to perform a timed transition. Player Min wants to minimise the average time per transition and player Max wants to maximise it. A solution of average-time games is presented using a reduction to average-price game on a finite graph. A direct consequence is an elementary proof of determinacy for average-time games. This complements our results for reachability-time games and partially solves a problem posed by Bouyer et al., to design an algorithm for solving average-price games on priced timed automata. The paper also establishes the exact computational complexity of solving average-time games: the problem is EXPTIME-complete for timed automata with at least two clocks.

[1]  Eugene Asarin,et al.  As Soon as Possible: Time Optimal Control for Timed Automata , 1999, HSCC.

[2]  Kim G. Larsen,et al.  Staying Alive as Cheaply as Possible , 2004, HSCC.

[3]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[4]  Thomas A. Henzinger,et al.  Minimum-Time Reachability in Timed Games , 2007, ICALP.

[5]  Marcin Jurdzinski,et al.  Concavely-Priced Timed Automata , 2008, FORMATS.

[6]  S. Lippman,et al.  Stochastic Games with Perfect Information and Time Average Payoff , 1969 .

[7]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

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

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

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

[11]  Dean Gillette,et al.  9. STOCHASTIC GAMES WITH ZERO STOP PROBABILITIES , 1958 .

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

[13]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[14]  PatersonMike,et al.  The complexity of mean payoff games on graphs , 1996 .

[15]  Donald A. Martin,et al.  The determinacy of Blackwell games , 1998, Journal of Symbolic Logic.

[16]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[17]  Marcin Jurdzinski,et al.  Model Checking Probabilistic Timed Automata with One or Two Clocks , 2007, Log. Methods Comput. Sci..

[18]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

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