Skip to Main content Skip to Navigation
Journal articles

Temporal Logics of Repeating Values

Abstract : Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecidability. In this paper, we study a linear-time temporal logic with past-time operators such that the freeze operator is only used to express that some value from an infinite set is repeated in the future or in the past. Such a restriction has been inspired by a recent work on spatio-temporal logics that suggests such a restricted use of the freeze operator. We show decidability of finitary and infinitary satisfiability by reduction into the verification of temporal properties in Petri nets by proposing a symbolic representation of models. This is a quite surprising result in view of the expressive power of the logic since the logic is closed under negation, contains future-time and past-time temporal operators and can express the nonce property and its negation. These ingredients are known to lead to undecidability with a more liberal use of the freeze quantifier. The paper also contains developments about the relationships between temporal logics with the freeze operator and counter automata as well as reductions into first-order logics over data words.
Complete list of metadata
Contributor : Stéphane Demri <>
Submitted on : Wednesday, April 7, 2021 - 7:56:14 AM
Last modification on : Friday, April 16, 2021 - 3:54:07 PM


Files produced by the author(s)



Stéphane Demri, Deepak Dsouza, Régis Gascon. Temporal Logics of Repeating Values. Journal of Logic and Computation, Oxford University Press (OUP), 2011, 22 (5), pp.1059-1096. ⟨10.1093/logcom/exr013⟩. ⟨hal-03191243⟩



Record views


Files downloads