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
Tayssir Touili and Byron Cook and Paul Jackson. CAV - 22nd International Conference on Computer Aided Verification - 2010, Jul 2010, Edinburgh, United Kingdom. Springer, 6174 (2), pp.148-161, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-14295-6_15>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00477149
Contributor : Frédéric Herbreteau <>
Submitted on : Wednesday, April 28, 2010 - 3:11:29 PM
Last modification on : Monday, June 3, 2013 - 8:50:09 PM
Document(s) archivé(s) le : Monday, October 22, 2012 - 3:31:58 PM

File

m.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Efficient Emptiness Check for Timed Büchi Automata. Tayssir Touili and Byron Cook and Paul Jackson. CAV - 22nd International Conference on Computer Aided Verification - 2010, Jul 2010, Edinburgh, United Kingdom. Springer, 6174 (2), pp.148-161, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-14295-6_15>. <hal-00477149>

Share

Metrics

Record views

260

Document downloads

104