TY - JOUR
T1 - Expressiveness of metric modalities for continuous time
AU - Hirshfeld, Yoram
AU - Rabinovich, Alexander
N1 - Publisher Copyright:
© Y. Hirshfeld and A. Rabinovich.
PY - 2007/2/23
Y1 - 2007/2/23
N2 - We prove a conjecture by A. Pnueli and strengthen it showing a sequence of “counting modalities” none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals. Moreover, there is no finite temporal logic that can express all of them over the real line, so that no finite metric temporal logic is expressively complete.
AB - We prove a conjecture by A. Pnueli and strengthen it showing a sequence of “counting modalities” none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals. Moreover, there is no finite temporal logic that can express all of them over the real line, so that no finite metric temporal logic is expressively complete.
KW - Expressive completeness
KW - Real Time
KW - Temporal Logics
UR - http://www.scopus.com/inward/record.url?scp=57649235691&partnerID=8YFLogxK
U2 - 10.2168/LMCS-3(1:3)2007
DO - 10.2168/LMCS-3(1:3)2007
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:57649235691
SN - 1860-5974
VL - 3
JO - Logical Methods in Computer Science
JF - Logical Methods in Computer Science
IS - 1
M1 - 3
ER -