Improving search order for reachability testing in timed automata

Abstract : Standard algorithms for reachability analysis of timed automata are sensitive to the order in which the transitions of the automata are taken. To tackle this problem, we propose a ranking system and a waiting strategy. This paper discusses the reason why the search order matters and shows how a ranking system and a waiting strategy can be integrated into the standard reachability algorithm to alleviate and prevent the problem respectively. Experiments show that the combination of the two approaches gives optimal search order on standard benchmarks except for one example. This suggests that it should be used instead of the standard BFS algorithm for reachability analysis of timed automata.
Type de document :
Communication dans un congrès
International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), Sep 2015, Madrid, Spain
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-01166741
Contributeur : Frédéric Herbreteau <>
Soumis le : mardi 23 juin 2015 - 10:18:15
Dernière modification le : mercredi 24 juin 2015 - 01:02:53
Document(s) archivé(s) le : mardi 15 septembre 2015 - 21:32:07

Fichiers

main.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

  • HAL Id : hal-01166741, version 1
  • ARXIV : 1506.07000

Collections

Citation

Frédéric Herbreteau, Thanh-Tung Tran. Improving search order for reachability testing in timed automata. International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), Sep 2015, Madrid, Spain. 〈hal-01166741〉

Partager

Métriques

Consultations de la notice

188

Téléchargements de fichiers

93