Title
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 article, 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 article 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.
Year
DOI
Venue
2012
10.1093/logcom/exr013
J. Log. Comput.
Keywords
Field
DocType
repeating values,temporal logic,temporal logics,liberal use,freeze operator,temporal property,freeze quantifier,past-time operator,past-time temporal operator,linear-time temporal logic,spatio-temporal logic,first-order logic
Computation tree logic,Discrete mathematics,Petri net,Negation,Satisfiability,Algorithm,Decidability,Finitary,Operator (computer programming),Temporal logic,Mathematics
Journal
Volume
Issue
ISSN
22
5
0955-792X
Citations 
PageRank 
References 
6
0.46
24
Authors
3
Name
Order
Citations
PageRank
Stéphane Demri183260.65
Deepak D’Souza2553.25
Régis Gascon3765.23