On the freeze quantifier in Constraint LTL: Decidability and complexity

  • Authors:

  • Stéphane Demri;Ranko Lazić;David Nowak

  • Affiliations:

  • LSV, CNRS & ENS Cachan & INRIA Futurs (projet SECSI), France;Department of Computer Science, University of Warwick, UK;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Japan

  • Venue:
  • Information and Computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Constraint LTL, a generalisation of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some real-time logics, but this variable-binding mechanism is quite general and ubiquitous in many logical languages (first-order temporal logics, hybrid logics, logics for sequence diagrams, navigation logics, logics with @l-abstraction, etc.). We show that Constraint LTL over the simple domain augmented with the freeze quantifier is undecidable which is a surprising result in view of the poor language for constraints (only equality tests). Many versions of freeze-free Constraint LTL are decidable over domains with qualitative predicates and our undecidability result actually establishes @S"1^1-completeness. On the positive side, we provide complexity results when the domain is finite (ExpSpace-completeness) or when the formulae are flat in a sense introduced in the paper. Our undecidability results are sharp (i.e. with restrictions on the number of variables) and all our complexity characterisations ensure completeness with respect to some complexity class (mainly PSpace and ExpSpace).