 |
Free and accessible knowledge |
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.
Cited literature [20 references]
https://hal.archives-ouvertes.fr/hal-00350475
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
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
File
CDFLL-concur05.pdf
Files produced by the author(s)