  We consider an extension of linear-time temporal logic (LTL) with both local
and remote data constraints interpreted over a concrete domain. This extension
is a natural extension of constraint LTL and the Temporal Logic of Repeating
Values, which have been studied before. We shall use previous results to prove
that the satisfiability problem for this logic is decidable. Further, we shall
see that trying to extend this logic by making it more expressive can lead to
undecidability.
