Decidability Results for Metric and Layered Temporal Logics

We study the decidability problem for metric and layered temporal logics. The logics we consider are suitable to model time granularity in various contexts, and they allow one to build granular temporal models by referring to thènatural scale' in any component of the model and by properly constraining the interactions between diierently-grained components. A monadic second-order language combining operators such as temporal contextualization and projection, together with the usual displacement operator of metric temporal logics, is considered, and the theory of nitely-layered metric temporal structures is shown to be decidable.

[1]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[2]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

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

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

[5]  Sushil Jajodia,et al.  Logical design for temporal databases with multiple granularities , 1997, TODS.

[6]  Dov M. Gabbay,et al.  Combining Temporal Logic Systems , 1996, Notre Dame J. Formal Log..

[7]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[8]  Angelo Montanari.  A decidable theory of nitely-layered metric temporal structures , 1996 .

[9]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[10]  José Luiz Fiadeiro,et al.  Sometimes "Tomorrow" is "Sometime" - Action Refinement in a Temporal Logic of Objects , 1994, ICTL.

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

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

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

[14]  R. McNaughton.  Review: J. Richard Buchi, Weak Second-Order Arithmetic and Finite Automata; J. Richard Buchi, On a Decision Method in Restricted second Order Arithmetic , 1963, Journal of Symbolic Logic.

[15]  M. de Rijke,et al.  Completeness Results for Two-sorted Metric Temporal Logics , 1995, AMAST.

[16]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[17]  Dirk Siefkes,et al.  Decidable Theories II , 1970 .