 |
|
|
|
| HAL: inria-00496366, version 1 |
| DOI: 10.1007/978-3-642-15643-4_17 |
| See detailed view |  BibTeX,EndNote,... |
|
|
| 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 1B. 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 – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Logic in Computer Science |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| inria-00496366, version 1 | |
| http://hal.inria.fr/inria-00496366 | |
| oai:hal.inria.fr:inria-00496366 | |
| From: Frédéric Herbreteau | |
| Submitted on: Wednesday, 30 June 2010 14:22:10 | |
| Updated on: Tuesday, 27 December 2011 12:56:55 | |
