Advertisement

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

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4144)

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 ω-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.

Keywords

State Machine Temporal Logic Linear Temporal Logic Atomic Proposition Temporal Reasoning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full conference paper text

References

  1. 1.
    Allen, J.: Towards a general theory of actions and time. Artificial Intelligence 23(2), 123–154 (1984)zbMATHCrossRefGoogle Scholar
  2. 2.
    Calvanese, D., De Giacomo, G., Vardi, M.Y.: Reasoning about actions and planning in LTL action theories. In: KR, pp. 593–602 (2002)Google Scholar
  3. 3.
    D’Amorim, M., Roşu, G.: Efficient monitoring of omega-languages. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 364–378. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Ghallab, M., Alaoui, A.M.: Managing efficiently temporal relations through indexed spanning trees. In: IJCAI, pp. 1297–1303 (1989)Google Scholar
  5. 5.
    Krokhin, A.A., Jeavons, P., Jonsson, P.: Reasoning about temporal relations: The tractable subalgebras of Allen’s interval algebra. J. ACM 50(5), 591–640 (2003)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Lacroix, S., Mallet, A., Bonnafous, D., Bauzil, G., Fleury, S., Herrb, M., Chatila, R.: Autonomous rover navigation on unknown terrains, functions and integration. International Journal of Robotics Research (2003)Google Scholar
  7. 7.
    Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Design Automation Conference (DAC 2001) (June 2001)Google Scholar
  8. 8.
    Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, New York. IEEE, Los Alamitos (1977)Google Scholar
  9. 9.
    Roşu, G., Bensalem, S.: Allen linear (interval) temporal logic – translation to LTL and monitor synthesis. Technical Report UIUCDCS-R-2006-2681, University of Illinois at Urbana-Champaign (January 2006)Google Scholar
  10. 10.
    Roşu, G., Havelund, K.: Rewriting-based techniques for runtime verification. J. of Automated Software Engineering 12(2), 151–197 (2005)CrossRefGoogle Scholar
  11. 11.
    Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733–749 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Vilain, M., Kautz, H., van Beek, P.: Constraint propagation algorithms for temporal reasoning: a revised report. In: Readings in Qualitative Reasoning about Phyisical Systems. Morgan Kaufmann, Los Altos (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUSA
  2. 2.VERIMAGGieresFrance

Personalised recommendations

Cite paper