Temporal Logics of Repeating Values - Université Nice Sophia Antipolis Accéder directement au contenu
Article Dans Une Revue Journal of Logic and Computation Année : 2011

Temporal Logics of Repeating Values

Résumé

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.
Fichier principal
Vignette du fichier
DDG-jlc11.pdf (430.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03191243 , version 1 (07-04-2021)

Identifiants

Citer

Stéphane Demri, Deepak d'Souza, Régis Gascon. Temporal Logics of Repeating Values. Journal of Logic and Computation, 2011, 22 (5), pp.1059-1096. ⟨10.1093/logcom/exr013⟩. ⟨hal-03191243⟩
82 Consultations
87 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More