Continuous time temporal logic with counting

Yoram Hirshfeld*, Alexander Rabinovich

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We add to the standard temporal logic TL(U,S) 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 dual C n, which says that X has happened n times in the last unit of time. We show that this temporal logic is expressively complete for the metric predicate logic Q2MLO, which is expressive, decidable and easy to use. In particular the Pnueli modalities Pn( X1,⋯, Xn), "there is an increasing sequence t1,⋯, tn of points in the unit interval ahead such that ti satisfies Xi", are definable in TL(U,S) with the counting modalities.

Original languageEnglish
Pages (from-to)1-9
Number of pages9
JournalInformation and Computation
StatePublished - May 2012


Dive into the research topics of 'Continuous time temporal logic with counting'. Together they form a unique fingerprint.

Cite this