Two-Way Unary Temporal Logic over Trees

Details Two-Way Unary Temporal Logic over Trees Two-Way Unary Temporal Logic over Trees

2009-04-27

arxiv.org/abs/0904.4119v2

LMCS 5 (3:5) 2009

Computer Science

Logic in Computer Science

29 pages. Journal version of a LICS 07 paper

Scientific paper

10.2168/LMCS-5(3:5)2009

We consider a temporal logic EF+F^-1 for unranked, unordered finite trees. The logic has two operators: EF\phi, which says "in some proper descendant \phi holds", and F^-1\phi, which says "in some proper ancestor \phi holds". We present an algorithm for deciding if a regular language of unranked finite trees can be expressed in EF+F^-1. The algorithm uses a characterization expressed in terms of forest algebras.

Affiliated with

Also associated with

No associations

Rating

Two-Way Unary Temporal Logic over Trees 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 Two-Way Unary Temporal Logic over Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-Way Unary Temporal Logic over Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-322511