BRANCHING-TIME VERSUS LINEAR-TIME - A Cooperative and Feasible Approach

Norihiro Kamide

Abstract

A new temporal logic called linear-time computation tree logic (LCTL) is obtained from computation tree logic (CTL) by adding some modified versions of the temporal operators of linear-time temporal logic (LTL). A theorem for embedding LCTL into CTL is proved. The model-checking, validity and satisfiability problems of LCTL are shown to be deterministic PTIME-complete, EXPTIME-complete and deterministic EXPTIMEcomplete, respectively.

References

  1. Biere, A., Cimatti, A., Clarke, E., Strichman, O., and Zhu, Y. (2003). Bounded model checking. Advances in Computers, 58:118-149.
  2. Cerrito, S. and Mayer, M. (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., 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. and Emerson, E. (1981). Design and synthesis of synchronization skeletons using branching time temporal logic. In Lecture Notes in Computer Science, volume 131, pages 52-71.
  5. Clarke, E., Grumberg, O., and Peled, D. (1999). Model checking. The MIT Press.
  6. Emerson, E. and Clarke, E. (1982). Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241-266.
  7. Emerson, E. and Halpern, J. (1986). “sometimes” and “not never” revisited: on branching versus linear time temporal logic. Journal of the ACM, 33 (1):151-178.
  8. Emerson, E. and Sistla, P. (1984). Deciding full branching time logic. Information and Control, 61:175-201.
  9. Hodkinson, I., Wolter, F., and Zakharyaschev, M. (2000). Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106:85-134.
  10. Pnueli, A. (1977). The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46-57.
  11. Sernadas, A. and Sernadas, C. (2003). Combining logic systems: why, how, what for? CIM Bulletin, 15:9-14.
  12. Sistla, A. and Clarke, E. (1985). The complexity of propositional linear temporal logic. Journal of the ACM, 32 (3):733-749.
  13. Vardi, M. (2001). Branching vs. linear time: final showdown. In Lecture Notes in Computer Science, volume 2031, pages 1-22.
Download


Paper Citation


in Harvard Style

Kamide N. (2010). BRANCHING-TIME VERSUS LINEAR-TIME - A Cooperative and Feasible Approach . In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-674-021-4, pages 522-526. DOI: 10.5220/0002709205220526


in Bibtex Style

@conference{icaart10,
author={Norihiro Kamide},
title={BRANCHING-TIME VERSUS LINEAR-TIME - A Cooperative and Feasible Approach},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2010},
pages={522-526},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002709205220526},
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 - BRANCHING-TIME VERSUS LINEAR-TIME - A Cooperative and Feasible Approach
SN - 978-989-674-021-4
AU - Kamide N.
PY - 2010
SP - 522
EP - 526
DO - 10.5220/0002709205220526