The Element of Surprise in Timed Games ⋆ In Proc. of CONCUR 2003: 14th International Conference on Concurrency Theory, Lectures Notes in Computer Science, Springer-Verlag, 2003.

We consider concurrent two-person games played in real time, in which the players decide both which action to play, and when to play it. Such timed games differ from untimed games in two essential ways. First, players can take each other by surprise, because actions are played with delays that cannot be anticipated by the opponent. Second, a player should not be able to win the game by preventing time from diverging. We present a model of timed games that preserves the ele- ment of surprise and accounts for time divergence in a way that treats both players symmetrically and applies to all !-regular winning condi- tions. We prove that the ability to take each other by surprise adds extra power to the players. For the case that the games are specified in the style of timed automata, we provide symbolic algorithms for their so- lution with respect to all !-regular winning conditions. We also show that for these timed games, memory strategies are more powerful than memoryless strategies already in the case of reachability objectives.

[1]  Thomas A. Henzinger,et al.  Symbolic Algorithms for Infinite-State Games , 2001, CONCUR.

[2]  Joseph Sifakis,et al.  On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.

[3]  Thomas A. Henzinger,et al.  Automating Modular Verification , 1999, CONCUR.

[4]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

[6]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[7]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[8]  Joseph Sifakis,et al.  Controller Synthesis for Timed Automata 1 , 1998 .

[9]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[10]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[11]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 2002, JACM.

[12]  Thomas A. Henzinger,et al.  Discrete-Time Control for Rectangular Hybrid Automata , 1997, Theor. Comput. Sci..

[13]  Thomas A. Henzinger,et al.  Modularity for Timed and Hybrid Systems , 1997, CONCUR.

[14]  Nancy A. Lynch,et al.  Liveness in Timed and Untimed Systems , 1998, Inf. Comput..

[15]  Thomas A. Henzinger,et al.  Rectangular Hybrid Games , 1999, CONCUR.

[16]  Thomas A. Henzinger,et al.  Timed Interfaces , 2002, EMSOFT.

[17]  Aniello Murano,et al.  Dense Real-Time Games , 2002, LICS.

[18]  Thomas A. Henzinger,et al.  From verification to control: dynamic programs for omega-regular objectives , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[19]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.