HAL : inria-00496366, version 1

DOI : 10.1007/978-3-642-15643-4_17

Voir la fiche détaillée

BibTeX,EndNote,... BibTeX - EndNote - TEI - RefWorks -

Automated Technology for Verification and Analysis - 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010. Proceedings, Singapore : Singapore (2010)

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

Frédéric Herbreteau 1, B. Srivathsan 1

(2010)

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.

1 :	Laboratoire Bordelais de Recherche en Informatique (LaBRI)
	CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux – Université Victor Segalen - Bordeaux II

Domaine

:

Informatique/Logique en informatique

inria-00496366, version 1

http://hal.inria.fr/inria-00496366

oai:hal.inria.fr:inria-00496366

Contributeur : Frédéric Herbreteau <>

Soumis le : Mercredi 30 Juin 2010, 14:22:10

Dernière modification le : Mardi 27 Décembre 2011, 12:56:55