Computer Science – Logic in Computer Science
Scientific paper
2010-10-06
Computer Science
Logic in Computer Science
Scientific paper
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic $LTL^\downarrow_1$ of Demri and Lazic with operators for navigation into the future and the past. By reduction to the emptiness problem for data automata it is shown that this basic logic is decidable. Whereas the basic logic only allows navigation to positions where a fixed data value occurs, extensions are studied that also allow navigation to positions with different data values. Besides some undecidable results it is shown that the extension by a certain UNTIL-operator with an inequality target condition remains decidable.
Kara Ahmet
Schwentick Thomas
Zeume Thomas
No associations
LandOfFree
Temporal Logics on Words with Multiple Data Values 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 Temporal Logics on Words with Multiple Data Values, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Temporal Logics on Words with Multiple Data Values will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-427716