TY - GEN
T1 - Allen linear (interval) temporal logic - Translation to LTL and monitor synthesis
AU - Roşu, Grigore
AU - Bensalem, Saddek
PY - 2006
Y1 - 2006
N2 - The relationship between two well established formalisms for temporal reasoning is first investigated, namely between Allen's interval algebra (or Allen's temporal logic, abbreviated ATL) and linear temporal logic (LTL). A discrete variant of ATL is defined, called Allen linear temporal logic (ALTL), whose models are ω-sequences of timepoints. It is shown that any ALTL formula can be linearly translated into an equivalent LTL formula, thus enabling the use of LTL techniques on ALTL requirements. This translation also implies the NP-completeness of ATL satisfiability. Then the problem of monitoring ALTL requirements is investigated, showing that it reduces to checking satisfiability; the similar problem for unrestricted LTL is known to require exponential space. An effective monitoring algorithm for ALTL is given, which has been implemented and experimented with in the context of planning applications.
AB - The relationship between two well established formalisms for temporal reasoning is first investigated, namely between Allen's interval algebra (or Allen's temporal logic, abbreviated ATL) and linear temporal logic (LTL). A discrete variant of ATL is defined, called Allen linear temporal logic (ALTL), whose models are ω-sequences of timepoints. It is shown that any ALTL formula can be linearly translated into an equivalent LTL formula, thus enabling the use of LTL techniques on ALTL requirements. This translation also implies the NP-completeness of ATL satisfiability. Then the problem of monitoring ALTL requirements is investigated, showing that it reduces to checking satisfiability; the similar problem for unrestricted LTL is known to require exponential space. An effective monitoring algorithm for ALTL is given, which has been implemented and experimented with in the context of planning applications.
UR - http://www.scopus.com/inward/record.url?scp=33749822024&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33749822024&partnerID=8YFLogxK
U2 - 10.1007/11817963_25
DO - 10.1007/11817963_25
M3 - Conference contribution
AN - SCOPUS:33749822024
SN - 354037406X
SN - 9783540374060
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 263
EP - 277
BT - Computer Aided Verification - 18th International Conference, CAV 2006, Proceedings
PB - Springer
T2 - 18th International Conference on Computer Aided Verification, CAV 2006
Y2 - 17 August 2006 through 20 August 2006
ER -