Skip to main content
Article thumbnail
Location of Repository

Efficient Emptiness Check for Timed Büchi Automata

By F. Herbreteau, B. Srivathsan and I. Walukiewicz

Abstract

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

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.170.1870
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.labri.fr/%7Eherbret... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.