Linear-time temporal logics with Presburger constraints: an overview ★

Journal of Applied Non-Classical Logics 16 (3-4):311-347 (2006)
  Copy   BIBTEX

Abstract

We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are well-designed to specify and verify systems that can be modelled with counter systems. The paper recalls the general framework of LTL over concrete domains and presents the main decidability and complexity results related to fragments of Presburger LTL. Related formalisms are also briefly presented

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,709

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Relational dual tableaux for interval temporal logics.David Bresolin, Joanna Golinska-Pilarek & Ewa Orlowska - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):251–277.
Presburger sets and p-minimal fields.Raf Cluckers - 2003 - Journal of Symbolic Logic 68 (1):153-162.
Decidability Results for Metric and Layered Temporal Logics.Angelo Montanari & Alberto Policriti - 1996 - Notre Dame Journal of Formal Logic 37 (2):260-282.
Logical Consecutions in Discrete Linear Temporal Logic.V. V. Rybakov - 2005 - Journal of Symbolic Logic 70 (4):1137 - 1149.

Analytics

Added to PP
2013-11-24

Downloads
40 (#396,692)

6 months
9 (#302,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

In so many possible worlds.Kit Fine - 1972 - Notre Dame Journal of Formal Logic 13 (4):516-520.
From local to global consistency.Rina Dechter - 1992 - Artificial Intelligence 55 (1):87-107.

View all 8 references / Add more references