Temporal Representation and Reasoning, International Syposium on (2011)
Sept. 12, 2011 to Sept. 14, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2011.9
Metric LTL formulas rely on the next operator to encode time distances, whereas qualitative LTL formulas use only the until operator. This paper shows how to transform any metric LTL formula M into a qualitative formula Q, such that Q is satisfiable if and only if M is satisfiable over words with variability bounded with respect to the largest distances used in M (i.e., occurrences of next), but the size of Q is independent of such distances. Besides the theoretical interest, this result can help simplify the verification of systems with time-granularity heterogeneity, where large distances are required to express the coarse-grain dynamics in terms of fine-grain time units.
linear temporal logic, quantitative time, bounded variability, satisfiability
Carlo A. Furia, Paola Spoletini, "On Relaxing Metric Information in Linear Temporal Logic", Temporal Representation and Reasoning, International Syposium on, vol. 00, no. , pp. 72-79, 2011, doi:10.1109/TIME.2011.9