HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

Contributor : Emmanuel Fleury Connect in order to contact the contributor
Submitted on : Tuesday, January 6, 2009 - 6:23:29 PM
Last modification on : Wednesday, April 27, 2022 - 3:43:46 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 6:46:21 PM


Files produced by the author(s)



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⟩



Record views


Files downloads