 |
|
|
|
| HAL: hal-00477149, version 1 |
| DOI: 10.1007/978-3-642-14295-6_15 |
| Detailed view |  Export this paper |
|
|
| Computer Aided Verification, 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010. Proceedings, Edinburgh : Royaume-Uni (2010) |
|
|
|
|
| Efficient Emptiness Check for Timed Büchi Automata |
|
|
Frédéric Herbreteau 1B. Srivathsan 1 |
|
|
| (2010-07-15) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 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 |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Formal Languages and Automata Theory |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00477149, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00477149 | |
| oai:hal.archives-ouvertes.fr:hal-00477149 | |
| From: Frédéric Herbreteau | |
| Submitted on: Wednesday, 28 April 2010 15:11:29 | |
| Updated on: Tuesday, 27 December 2011 12:57:49 | |
