Completeness Results for Two-sorted Metric Temporal Logics

Temporal logic has been successfully used for modeling and analyzing the behavior of reactive and concurrent systems. One short-coming of (standard) temporal logic is that it is inadequate for real-time applications, because it only deals with qualitative timing properties. This is overcome by metric temporal logics which offer a uniform logical framework in which both qualitative and quantitative timing properties can be expressed by making use of a parameterized operator of relative temporal realization. We view metric temporal logics as two-sorted formalisms having formulae ranging over time instants and parameters ranging over an (ordered) abelian group of temporal displacements. In this paper we deal with completeness results for basic systems of metric temporal logic — such issues have largely been ignored in the literature. We first provide an axiomatization of the pure metric fragment of the logic, and prove its soundness and completeness.Then, we show how to obtain the metric temporal logic of linear orders by adding an ordering over displacements.

[1]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[2]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[3]  Nicholas Rescher,et al.  Temporal Logic = Library of Exact Philosophy, Vol. 3 , 1973 .

[4]  Jonathan S. Ostroff,et al.  Temporal logic for real-time systems , 1989 .

[5]  Hans Jürgen Ohlbach,et al.  Translation Methods for Non-Classical Logics: An Overview , 1993, Log. J. IGPL.

[6]  Angelo Montanari,et al.  A Set-Theoretic Translation Method for (Poly)modal Logics , 1995, STACS.

[7]  Nicholas Rescher,et al.  Topological Logic , 1969, Journal of Symbolic Logic.

[8]  Ron Koymans,et al.  Specifying Message Passing and Time-Critical Systems with Temporal Logic , 1992, Lecture Notes in Computer Science.

[9]  Thomas A. Henzinger,et al.  The temporal specification and verification of real-time systems , 1991 .

[10]  John P. Burgess,et al.  Basic Tense Logic , 1984 .

[11]  Peter Øhrstrøm,et al.  Temporal Logic , 1994, Lecture Notes in Computer Science.

[12]  Angelo Montanari,et al.  Embedding Time Granularity in a Logical Specification Language for Synchronous Real-Time Systems , 1993, Sci. Comput. Program..

[13]  M. de Rijke,et al.  The Modal Logic of Inequality , 1992, J. Symb. Log..

[14]  M. de Rijke,et al.  Sahlqvist's theorem for boolean algebras with operators with an application to cylindric algebras , 1995, Stud Logica.

[15]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..