Safety alternating automata on data words

Details Safety alternating automata on data words Safety alternating automata on data words

2008-02-28

arxiv.org/abs/0802.4237v3

Computer Science

Logic in Computer Science

23 pages

Scientific paper

A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. Safety one-way alternating automata with one register on infinite data words are considered, their nonemptiness is shown EXPSPACE-complete, and their inclusion decidable but not primitive recursive. The same complexity bounds are obtained for satisfiability and refinement, respectively, for the safety fragment of linear temporal logic with freeze quantification. Dropping the safety restriction, adding past temporal operators, or adding one more register, each causes undecidability.

Affiliated with

Also associated with

No associations

Rating

Safety alternating automata on data words 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 Safety alternating automata on data words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Safety alternating automata on data words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472110