The Element of Surprise in Timed Games
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 element of surprise and accounts for time divergence in a way that treats both players symmetrically and applies to all ω-regular winning conditions. 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 solution 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.
KeywordsLocation Goal Winning Strategy Game Structure Clock Condition Winning Condition
Unable to display preview. Download preview PDF.
- [AH97]Alur, R., Henzinger, T.A.: Modularity for timed and hybrid systems. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 74–88. Springer, Heidelberg (1997)Google Scholar
- [AMPS98]Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: Proc. IFAC Symp. System Structure and Control, pp. 469–474. Elsevier, Amsterdam (1998)Google Scholar
- [Chu63]Church, A.: Logic, arithmetics, and automata. In: Proc. Int. Congress of Mathematicians, 1962, pp. 23–35 (1963)Google Scholar
- [EJ91]Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus, and determinacy. In: Proc. Symp. Foundations of Comp. Sci., pp. 368–377. IEEE, Los Alamitos (1991)Google Scholar
- [FLM02]Faella, M., La Torre, S., Murano, A.: Dense real-time games. In: Proc. Symp. Logic in Comp. Sci., pp. 167–176. IEEE, Los Alamitos (2002)Google Scholar
- [MPS95]Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 229–242. Springer, Heidelberg (1995)Google Scholar
- [PR89]Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. Symp. Principles of Programming Languages, pp. 179–190. ACM, New York (1989)Google Scholar
- [RW89]Ramadge, P.J.G., Wonham, W.M.: The control of discrete-event systems. IEEE Transactions on Control Theory 77, 81–98 (1989)Google Scholar
- [Tho90]Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook Theor. Comp. Sci., vol. B, pp. 135–191. Elsevier, Amsterdam (1990)Google Scholar
- [Yi90]Yi, W.: Real-time behaviour of asynchronous agents. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 502–520. Springer, Heidelberg (1990)Google Scholar