Efficient Emptiness Check for Timed Büchi Automata (Extended version) - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Formal Methods in System Design Année : 2012

Efficient Emptiness Check for Timed Büchi Automata (Extended version)

Résumé

The Büchi non-emptiness problem for timed automata refers to 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, it is shown that this simple transformation may sometimes result in an exponential blowup. A construction avoiding this blowup is proposed. It is also shown that in many cases, non-Zenoness can be ascertained without extra construction. An on-the-fly algorithm for the non-emptiness problem, using non-Zenoness construction only when required, is proposed. Experiments carried out with a prototype implementation of the algorithm are reported.

Dates et versions

inria-00584849 , version 1 (11-04-2011)

Identifiants

Citer

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Efficient Emptiness Check for Timed Büchi Automata (Extended version). Formal Methods in System Design, 2012, Special issue on Computer Aided Verification (CAV'10), 40 (2), pp.122-146. ⟨10.1007/s10703-011-0133-1⟩. ⟨inria-00584849⟩

Collections

CNRS
27 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More