DocumentCode
2141348
Title
On Relaxing Metric Information in Linear Temporal Logic
Author
Furia, Carlo A. ; Spoletini, Paola
fYear
2011
fDate
12-14 Sept. 2011
Firstpage
72
Lastpage
79
Abstract
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.
Keywords
computability; matrix algebra; temporal logic; bounded variability; coarse-grain dynamics; fine-grain time units; linear temporal logic; metric LTL formulas; qualitative formula; satisfiability; time-granularity heterogeneity; Cognition; Complexity theory; Encoding; Measurement; Nominations and elections; Polynomials; Transforms; bounded variability; linear temporal logic; quantitative time; satisfiability;
fLanguage
English
Publisher
ieee
Conference_Titel
Temporal Representation and Reasoning (TIME), 2011 Eighteenth International Symposium on
Conference_Location
Lubeck
ISSN
1530-1311
Print_ISBN
978-1-4577-1242-5
Type
conf
DOI
10.1109/TIME.2011.9
Filename
6065231
Link To Document