Efficient On-the-fly Algorithms for the Analysis of Timed Games

Franck Cassez (1) , Alexandre David (2) , Emmanuel Fleury (3) , Kim Guldstrand Larsen (2) , Didier Lime (1)

1 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
2 CISS - Center for Indlejrede Software Systemer
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

In this paper, we propose a first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The algorithm we propose is a symbolic extension of the on-the-fly algorithm suggested by Liu & Smolka for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space. Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure. Various optimizations of the basic symbolic algorithm are proposed as well as methods for obtaining time-optimal winning strategies (for reachability games). Extensive evaluation of an experimental implementation of the algorithm yields very encouraging performance results.

Domaines: Autre [cs.OH]

Franck Cassez, Alexandre David, Emmanuel Fleury, Kim Guldstrand Larsen, Didier Lime. Efficient On-the-fly Algorithms for the Analysis of Timed Games. 16th International Conference on Concurrency Theory (CONCUR'05), 2005, San Francisco, United States. pp.66-80, ⟨10.1007/11539452⟩. ⟨hal-00350475⟩