Temporal Logics on Words with Multiple Data Values

Authors Ahmet Kara, Thomas Schwentick, Thomas Zeume

Thumbnail PDF


  • Filesize: 472 kB
  • 12 pages

Document Identifiers

Author Details

Ahmet Kara
Thomas Schwentick
Thomas Zeume

Cite AsGet BibTex

Ahmet Kara, Thomas Schwentick, and Thomas Zeume. Temporal Logics on Words with Multiple Data Values. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 481-492, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


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.
  • Expressiveness
  • Decidability
  • Temporal Logic
  • Data words


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads