Efficient Emptiness Check for Timed Büchi Automata

Frédéric Herbreteau (1) , B. Srivathsan (1) , Igor Walukiewicz (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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.

Domaines: Théorie et langage formel [cs.FL]

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⟩