TY - JOUR

T1 - Continuous time temporal logic with counting

AU - Hirshfeld, Yoram

AU - Rabinovich, Alexander

PY - 2012/5

Y1 - 2012/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84857326045&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2011.11.003

DO - 10.1016/j.ic.2011.11.003

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84857326045

SN - 0890-5401

VL - 214

SP - 1

EP - 9

JO - Information and Computation

JF - Information and Computation

ER -