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

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

2011-04-08

arxiv.org/abs/1104.1540v3

Computer Science

Logic in Computer Science

Published in the Special Issue on Computer Aided Verification - CAV 2010; Formal Methods in System Design, 2011

Scientific paper

10.1007/s10703-011-0133-1

The B\"uchi non-emptiness problem for timed automata refers to deciding if a given automaton has an infinite non-Zeno run satisfying the B\"uchi 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.

Affiliated with

Also associated with

No associations

Rating

Efficient Emptiness Check for Timed Büchi Automata (Extended version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Emptiness Check for Timed Büchi Automata (Extended version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Emptiness Check for Timed Büchi Automata (Extended version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-354606