We propose an extension, called L + p , of the temporal logic LTL, which enables talking about nitely many register values: the models are innnite words over tuples of integers (resp. real numbers). The formulas of L + p are at: on the left of an until, only atomic formulas or LTL formulas are allowed. We prove, in the spirit of the correspondence between automata and temporal logics, that the ...