Efficient On-The-Fly Emptiness Check for Timed Büchi Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

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


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.
Fichier principal
Vignette du fichier
atva2010-full.pdf (277.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00496366 , version 1 (30-06-2010)



Frédéric Herbreteau, B. Srivathsan. Efficient On-The-Fly Emptiness Check for Timed Büchi Automata. ATVA - 8th International Symposium on Automated Technology for Verification and Analysis - 2010, Sep 2010, Singapore, Singapore. pp.218-232, ⟨10.1007/978-3-642-15643-4_17⟩. ⟨inria-00496366⟩


165 View
202 Download



Gmail Facebook Twitter LinkedIn More