A decidable temporal logic with repeating values

Demri, Stéphane and D'Souza, Deepak and Gascon, Régis (2007) A decidable temporal logic with repeating values. In: LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science, Heidelberg.

Preview

PDF 10.1.1.117.2716.pdf - Published Version Download (300Kb)

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. 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.

Item Type:	Conference Paper
Additional Information:	Copyright of this article belongs to Springer-Verlag Berlin.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited:	17 Oct 2011 05:20
Last Modified:	17 Oct 2011 05:20
URI:	http://eprints.iisc.ernet.in/id/eprint/41460

Actions (login required)

View Item