Allen Linear (Interval) Temporal Logic --Translation to LTL and Monitor Synthesis--

Abstract

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 \omega-sequences of timepoints, like in \LTL. It is shown that any \ALTL formula can be linearly translated into an equivalent \LTL formula, thus enabling the use of \LTL techniques and tools when requirements are expressed in \ALTL. %This translation also implies the NP-completeness of \ATL satisfiability. Then the monitoring problem for \ALTL is discussed, showing that it is NP-complete despite the fact that the similar problem for \LTL is EXPSPACE-complete. An effective monitoring algorithm for \ALTL is given, which has been implemented and experimented with in the context of planning applications.Submitted by Mark Faust ([email protected]) on 2009-04-20T19:31:39Z No. of bitstreams: 1 Allen Linear (Interval) Temporal Logic --Translation to LTL and Monitor Synthesis--.pdf: 298392 bytes, checksum: adc9db1c10a4ad9710ca8291aa13fc29 (MD5)Made available in DSpace on 2009-04-20T19:31:39Z (GMT). No. of bitstreams: 1 Allen Linear (Interval) Temporal Logic --Translation to LTL and Monitor Synthesis--.pdf: 298392 bytes, checksum: adc9db1c10a4ad9710ca8291aa13fc29 (MD5) Previous issue date: 2006-0