Skip to Main content Skip to Navigation
Conference papers

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

Cited literature [12 references]  Display  Hide  Download
Contributor : Frédéric Herbreteau Connect in order to contact the contributor
Submitted on : Tuesday, June 23, 2015 - 10:18:15 AM
Last modification on : Saturday, June 25, 2022 - 10:35:45 AM
Long-term archiving on: : Tuesday, September 15, 2015 - 9:32:07 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License


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



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⟩



Record views


Files downloads