Deterministic Automata for the (F,G)-fragment of LTL

Details Deterministic Automata for the (F,G)-fragment of LTL Deterministic Automata for the (F,G)-fragment of LTL

2012-04-23

arxiv.org/abs/1204.5057v1

Computer Science

Logic in Computer Science

Scientific paper

When dealing with linear temporal logic properties in the setting of e.g. games or probabilistic systems, one often needs to express them as deterministic omega-automata. In order to translate LTL to deterministic omega-automata, the traditional approach first translates the formula to a non-deterministic B\"uchi automaton. Then a determinization procedure such as of Safra is performed yielding a deterministic \omega-automaton. We present a direct translation of the (F,G)-fragment of LTL into deterministic \omega-automata with no determinization procedure involved. Since our approach is tailored to LTL, we often avoid the typically unnecessarily large blowup caused by general determinization algorithms. We investigate the complexity of this translation and provide experimental results and compare them to the traditional method.

Affiliated with

Also associated with

No associations

Rating

Deterministic Automata for the (F,G)-fragment of LTL 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 Deterministic Automata for the (F,G)-fragment of LTL, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Automata for the (F,G)-fragment of LTL will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-444042