Efficient On-The-Fly Emptiness Check for Timed Büchi Automata

Abstract : The Büchi non-emptiness problem for timed automata concerns deciding if a given automaton has an infinite non-Zeno run satisfying the Büchi accepting condition. The solution to this problem amounts to searching for a cycle in the so-called zone graph of the automaton. Since non-Zenoness cannot be verified directly from the zone graph, additional constructions are required. In this paper, it is shown that in many cases, non-Zenoness can be ascertained without extra constructions. An on-the-fly algorithm for the non-emptiness problem, using an efficient non-Zenoness construction only when required, is proposed. Experiments carried out with a prototype implementation of the algorithm are reported and the results are seen to be promising.
Document type :
Conference papers
Ahmed Bouajjani and Wei-Ngan Chin. ATVA - 8th International Symposium on Automated Technology for Verification and Analysis - 2010, Sep 2010, Singapore, Singapore. Springer, 6252, pp.218-232, 2010, Lecture Notes in Computer Science; ATVA. <10.1007/978-3-642-15643-4_17>
Liste complète des métadonnées


https://hal.inria.fr/inria-00496366
Contributor : Frédéric Herbreteau <>
Submitted on : Wednesday, June 30, 2010 - 2:22:10 PM
Last modification on : Monday, June 3, 2013 - 8:14:42 PM
Document(s) archivé(s) le : Tuesday, October 23, 2012 - 9:40:37 AM

File

atva2010-full.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Frédéric Herbreteau, B. Srivathsan. Efficient On-The-Fly Emptiness Check for Timed Büchi Automata. Ahmed Bouajjani and Wei-Ngan Chin. ATVA - 8th International Symposium on Automated Technology for Verification and Analysis - 2010, Sep 2010, Singapore, Singapore. Springer, 6252, pp.218-232, 2010, Lecture Notes in Computer Science; ATVA. <10.1007/978-3-642-15643-4_17>. <inria-00496366>

Share

Metrics

Record views

182

Document downloads

136