Skip to Main content Skip to Navigation
Conference papers

Efficient 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 standard solution to this problem involves adding an auxiliary clock to take care of the non-Zenoness. In this paper, we show that this simple transformation may sometimes result in an exponential blowup. We propose a method avoiding this blowup.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00477149
Contributor : Frédéric Herbreteau Connect in order to contact the contributor
Submitted on : Wednesday, April 28, 2010 - 3:11:29 PM
Last modification on : Saturday, June 25, 2022 - 10:32:01 AM
Long-term archiving on: : Monday, October 22, 2012 - 3:31:58 PM

File

m.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | ANR

Citation

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Efficient Emptiness Check for Timed Büchi Automata. CAV - 22nd International Conference on Computer Aided Verification - 2010, Jul 2010, Edinburgh, United Kingdom. pp.148-161, ⟨10.1007/978-3-642-14295-6_15⟩. ⟨hal-00477149⟩

Share

Metrics

Record views

208

Files downloads

127