An Expressive Temporal Logic for Real Time

We add to the standard temporal logic with the modalities ”Until” and ”Since”, a sequence of “counting modalities”: For each n the modality Cn(X), which says that X will be true at least at n points in the next unit of time, and its past counterpart ${\overleftarrow{C}_n}$, which says that X has happened at least n times in the last unit of time. We prove that this temporal logic is as expressive as can be hoped for; all the modalities that can be expressed in a strong natural decidable predicate logic framework, are expressible in this temporal logic.

[1]  Thomas A. Henzinger,et al.  It's About Time: Real-Time Logics Reviewed , 1998, CONCUR.

[2]  Johann A. Makowsky,et al.  Algorithmic uses of the Feferman-Vaught Theorem , 2004, Ann. Pure Appl. Log..

[3]  Yoram Hirshfeld,et al.  Timer formulas and decidable metric temporal logic , 2005, Inf. Comput..

[4]  A. Dawar FINITE MODEL THEORY (Perspectives in Mathematical Logic) , 1997 .

[5]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[6]  Yoram Hirshfeld,et al.  A Framework for Decidable Metrical Logics , 1999, ICALP.

[7]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[8]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

[9]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[10]  S. Feferman,et al.  The first order properties of products of algebraic systems , 1959 .

[11]  Yoram Hirshfeld,et al.  Quantitative Temporal Logic , 1999, CSL.

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

[13]  Yoram Hirshfeld,et al.  Logics for Real Time: Decidability and Complexity , 2004, Fundam. Informaticae.

[14]  Alexander Moshe Rabinovich,et al.  Expressive Power of Temporal Logics , 2002, CONCUR.

[15]  Zohar Manna,et al.  Models for reactivity , 1993, Acta Informatica.

[16]  Janusz A. Brzozowski,et al.  The Dot-Depth Hierarchy of Star-Free Languages is Infinite , 1978, J. Comput. Syst. Sci..

[17]  S. Shelah The monadic theory of order , 1975, 2305.00968.

[18]  Amir Pnueli,et al.  A really abstract concurrent model and its temporal logic , 1986, POPL '86.

[19]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, JACM.

[20]  Wolfgang Thomas,et al.  Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words , 1997, Structures in Logic and Computer Science.

[21]  A. Ehrenfeucht An application of games to the completeness problem for formalized theories , 1961 .

[22]  Thomas Wilke,et al.  Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata , 1994, FTRTFT.