Using non-convex approximations for efficient analysis of timed automata: Extended version

Abstract : The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone graph of the automaton, which in principle could be infinite. In order to make the graph finite, zones are approximated using an extrapolation operator. For reasons of efficiency in current algorithms extrapolation of a zone is always a zone; and in particular it is convex. In this paper, we propose to solve the reachability problem without such extrapolation operators. To ensure termination, we provide an efficient algorithm to check if a zone is included in the so called region closure of another. Although theoretically better, closure cannot be used in the standard algorithm since a closure of a zone may not be convex. An additional benefit of the proposed approach is that it permits to calculate approximating parameters on-the-fly during exploration of the zone graph, as opposed to the current methods which do it by a static analysis of the automaton prior to the exploration. This allows for further improvements in the algorithm. Promising experimental results are presented.
Type de document :
Communication dans un congrès
Chakraborty, Supratik and Kumar, Amit. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, Dec 2011, Mumbai, India. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 13, pp.78-89, 2011, LIPIcs. 〈10.4230/LIPIcs.FSTTCS.2011.78〉
Liste complète des métadonnées

Littérature citée [3 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00559902
Contributeur : Frédéric Herbreteau <>
Soumis le : jeudi 3 novembre 2011 - 11:22:21
Dernière modification le : jeudi 11 janvier 2018 - 06:20:16
Document(s) archivé(s) le : dimanche 4 décembre 2016 - 19:30:37

Fichiers

m-HAL.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Frédéric Herbreteau, D. Kini, B. Srivathsan, Igor Walukiewicz. Using non-convex approximations for efficient analysis of timed automata: Extended version. Chakraborty, Supratik and Kumar, Amit. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, Dec 2011, Mumbai, India. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 13, pp.78-89, 2011, LIPIcs. 〈10.4230/LIPIcs.FSTTCS.2011.78〉. 〈inria-00559902v3〉

Partager

Métriques

Consultations de la notice

362

Téléchargements de fichiers

206