On reachability games of ordinal length

  • Authors:

  • Julien Cristau;Florian Horn

  • Affiliations:

  • LIAFA, Université Paris 7, Paris 5, France;LIAFA, Université Paris 7, Paris 5, France and Lehrstuhl für Informatik VII, RWTH, Aachen, Germany

  • Venue:
  • SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Games are a classical model in the synthesis of controllers in the open setting. In particular, games of infinite length can represent systems which are not expected to reach a correct state, but rather to handle a continuous stream of events. Yet, even longer sequences of events have to be considered when infinite sequences of events can occur in finite time -- Zeno behaviours. In this paper, we extend two-player games to this setting by considering plays of ordinal length. Our two main results are determinacy of reachability games of length less than ωω on finite arenas, and the PSPACE-completeness of deciding the winner in such a game.