A Decidable Temporal Logic of Repeating Values

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. We show decidability of finitary and infinitary satisfiability by reduction into the verification of temporal properties in Petri nets. This is a surprising result 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.

• Type: Conference
• Year: 2007
• Where: LFCS
• Authors: Stéphane Demri, Deepak D'Souza, Régis Gascon
• Keywords: Freeze Quantifier, LFCS 2007, Linear-time Temporal Logic, Various Logical Formalisms