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

Norihiro Kamide

2010

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.

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