TY - GEN
T1 - An expressive temporal logic for real time
AU - Hirshfeld, Yoram
AU - Rabinovich, Alexander
PY - 2006
Y1 - 2006
N2 - 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 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.
AB - 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 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.
UR - https://www.scopus.com/pages/publications/33750053537
U2 - 10.1007/11821069_43
DO - 10.1007/11821069_43
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:33750053537
SN - 3540377913
SN - 9783540377917
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 492
EP - 504
BT - Mathematical Foundations of Computer Science 2006 - 31st International Symposium, MFCS 2006, Proceedings
PB - Springer Verlag
T2 - 31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006
Y2 - 28 August 2006 through 1 September 2006
ER -