The Complexity of Satisfiability for Fragments of CTL and CTL*

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

View graph of relations

Details

Original languageEnglish
Title of host publicationProceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008)
Pages201-213
Number of pages13
Volume223
Publication statusPublished - 2008

Publication series

NameElectron. Notes Theor. Comput. Sci.

Cite this

The Complexity of Satisfiability for Fragments of CTL and CTL*. / Meier, Arne; Mundhenk, Martin; Thomas, Michael et al.
Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Vol. 223 2008. p. 201-213 (Electron. Notes Theor. Comput. Sci.).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Meier, A, Mundhenk, M, Thomas, M & Vollmer, H 2008, The Complexity of Satisfiability for Fragments of CTL and CTL*. in Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). vol. 223, Electron. Notes Theor. Comput. Sci., pp. 201-213. https://doi.org/10.1016/j.entcs.2008.12.040
Meier, A., Mundhenk, M., Thomas, M., & Vollmer, H. (2008). The Complexity of Satisfiability for Fragments of CTL and CTL*. In Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008) (Vol. 223, pp. 201-213). (Electron. Notes Theor. Comput. Sci.). https://doi.org/10.1016/j.entcs.2008.12.040
Meier A, Mundhenk M, Thomas M, Vollmer H. The Complexity of Satisfiability for Fragments of CTL and CTL*. In Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Vol. 223. 2008. p. 201-213. (Electron. Notes Theor. Comput. Sci.). doi: 10.1016/j.entcs.2008.12.040
Meier, Arne ; Mundhenk, Martin ; Thomas, Michael et al. / The Complexity of Satisfiability for Fragments of CTL and CTL*. Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Vol. 223 2008. pp. 201-213 (Electron. Notes Theor. Comput. Sci.).
Download
@inproceedings{56678839adc241f09cb15b15df1af121,
title = "The Complexity of Satisfiability for Fragments of CTL and CTL*",
author = "Arne Meier and Martin Mundhenk and Michael Thomas and Heribert Vollmer",
note = "Funding information: 1 Supported in part by DFG VO 630/6-1. 2 Email: meier@thi.uni-hannover.de 3 Email: mundhenk@cs.uni-jena.de 4 Email: thomas@thi.uni-hannover.de 5 Email: vollmer@thi.uni-hannover.de",
year = "2008",
doi = "10.1016/j.entcs.2008.12.040",
language = "English",
volume = "223",
series = "Electron. Notes Theor. Comput. Sci.",
pages = "201--213",
booktitle = "Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008)",

}

Download

TY - GEN

T1 - The Complexity of Satisfiability for Fragments of CTL and CTL*

AU - Meier, Arne

AU - Mundhenk, Martin

AU - Thomas, Michael

AU - Vollmer, Heribert

N1 - Funding information: 1 Supported in part by DFG VO 630/6-1. 2 Email: meier@thi.uni-hannover.de 3 Email: mundhenk@cs.uni-jena.de 4 Email: thomas@thi.uni-hannover.de 5 Email: vollmer@thi.uni-hannover.de

PY - 2008

Y1 - 2008

U2 - 10.1016/j.entcs.2008.12.040

DO - 10.1016/j.entcs.2008.12.040

M3 - Conference contribution

VL - 223

T3 - Electron. Notes Theor. Comput. Sci.

SP - 201

EP - 213

BT - Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008)

ER -

By the same author(s)