A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
Editors: Kamal Lodaya, Meena Mahajan
IARCS Int'l Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 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 ↓ 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 datafatcat:rbm4iwqkjzhtho2abwwv6ddrze