REASONING ABOUT BOUNDED TIME DOMAIN - An Alternative to NP-Complete Fragments of LTL

Norihiro Kamide

Abstract

It is known that linear-time temporal logic (LTL) is one of the most useful logics for reasoning about time and for verifying concurrent systems. It is also known that the satisfiability problem for LTL is PSPACE-complete and that finding NP-complete fragments of LTL is an important issue for constructing efficiently executable temporal logics. In this paper, an alternative NP-complete logic called bounded linear-time temporal logic is obtained from LTL by restricting the time domain of temporal operators.

References

  1. Biere, A., Cimatti, A., Clarke, E. M., Strichman, O., and Zhu, Y. (2003). Bounded model checking. Advances in Computers, 58:118-149.
  2. Cerrito, S. and Mayer, M. C. (1998). Bounded model search in linear temporal logic and its application to planning. In Lecture Notes in Computer Science, volume 1397, pages 124-140.
  3. Cerrito, S., Mayer, M. C., and Prand, S. (1999). First order linear temporal logic over finite time structures. In Lecture Notes in Computer Science, volume 1705, pages 62-76.
  4. Clarke, E. M., Grumberg, O., and Peled, D. A. (1999). Model Checking. The MIT Press.
  5. Demri, S. and Schnoebelen, P. (2002). The complexity of propositional linear temporal logics in simple cases. Infomation and Computation, 174 (1):84-103.
  6. Etessami, K., Vardi, M. Y., and Wilke, T. (1997). First-order logic with two variables and unary temporal logic. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), pages 228- 235.
  7. Hodkinson, I., Wolter, F., and Zakharyaschev, M. (2000). Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106:85-134.
  8. Holzmann, G. J. (2006). The SPIN model checker: Primer and reference manual. Addison-Wesley.
  9. Kamide, N. (2008). Bounded linear-time temporal logic: From gentzen to robinson. manuscript.
  10. Muscholl, A. and Walukiewicz, I. (2005). An np-complete fragment of ltl. International Journal of Foundations of Computer Science, 16 (4):743-753.
  11. Pnueli, A. (1977). The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46-57.
  12. Sistla, A. P. and Clarke, E. M. (1985). The complexity of propositional linear temporal logic. Journal of the ACM, 32 (3):733-749.
  13. Walukiewicz, I. (1998). Difficult configurations - on the complexity of ltrl. In Lecture Notes in Computer Science, volume 1443, pages 140-151.
Download


Paper Citation


in Harvard Style

Kamide N. (2010). REASONING ABOUT BOUNDED TIME DOMAIN - An Alternative to NP-Complete Fragments of LTL . In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-674-021-4, pages 536-539. DOI: 10.5220/0002714805360539


in Bibtex Style

@conference{icaart10,
author={Norihiro Kamide},
title={REASONING ABOUT BOUNDED TIME DOMAIN - An Alternative to NP-Complete Fragments of LTL},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2010},
pages={536-539},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002714805360539},
isbn={978-989-674-021-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - REASONING ABOUT BOUNDED TIME DOMAIN - An Alternative to NP-Complete Fragments of LTL
SN - 978-989-674-021-4
AU - Kamide N.
PY - 2010
SP - 536
EP - 539
DO - 10.5220/0002714805360539