Almost Linear Büchi Automata

Details Almost Linear Büchi Automata Almost Linear Büchi Automata

2009-11-11

arxiv.org/abs/0911.2033v1

EPTCS 8, 2009, pp. 16-25

Computer Science

Formal Languages and Automata Theory

Scientific paper

10.4204/EPTCS.8.2

We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Buechi automata (BA) called Almost linear Buechi automata (ALBA). We provide effective translations between LIO and ALBA showing that the two formalisms are expressively equivalent. While standard translations of LTL into BA use some intermediate formalisms, the presented translation of LIO into ALBA is direct. As we expect applications of ALBA in model checking, we compare the expressiveness of ALBA with other classes of Buechi automata studied in this context and we indicate possible applications.

Affiliated with

Also associated with

No associations

Rating

Almost Linear Büchi Automata 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 Almost Linear Büchi Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost Linear Büchi Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532834