Details
| Original language | English |
|---|---|
| Pages (from-to) | 901-918 |
| Journal | Int. J. Found. Comput. Sci. |
| Volume | 20 |
| Issue number | 5 |
| Publication status | Published - 2009 |
ASJC Scopus subject areas
- Computer Science(all)
- Computer Science (miscellaneous)
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
The Complexity of Satisfiability for Fragments of CTL and CTL*. / Meier, Arne; Thomas, Michael; Vollmer, Heribert et al.
In: Int. J. Found. Comput. Sci., Vol. 20, No. 5, 2009, p. 901-918.
In: Int. J. Found. Comput. Sci., Vol. 20, No. 5, 2009, p. 901-918.
Research output: Contribution to journal › Article › Research › peer review
Meier, A, Thomas, M, Vollmer, H & Mundhenk, M 2009, 'The Complexity of Satisfiability for Fragments of CTL and CTL*', Int. J. Found. Comput. Sci., vol. 20, no. 5, pp. 901-918. https://doi.org/10.1016/j.entcs.2008.12.040, https://doi.org/10.1142/S0129054109006954, https://doi.org/10.1142/S012905411592001X
Meier, A., Thomas, M., Vollmer, H., & Mundhenk, M. (2009). The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci., 20(5), 901-918. https://doi.org/10.1016/j.entcs.2008.12.040, https://doi.org/10.1142/S0129054109006954, https://doi.org/10.1142/S012905411592001X
Meier A, Thomas M, Vollmer H, Mundhenk M. The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 2009;20(5):901-918. doi: 10.1016/j.entcs.2008.12.040, 10.1142/S0129054109006954, 10.1142/S012905411592001X
Download
@article{dc181d6a264a44c9adcf8deecada8b65,
title = "The Complexity of Satisfiability for Fragments of CTL and CTL*",
author = "Arne Meier and Michael Thomas and Heribert Vollmer and Martin Mundhenk",
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 = "2009",
doi = "10.1016/j.entcs.2008.12.040",
language = "English",
volume = "20",
pages = "901--918",
number = "5",
}
Download
TY - JOUR
T1 - The Complexity of Satisfiability for Fragments of CTL and CTL*
AU - Meier, Arne
AU - Thomas, Michael
AU - Vollmer, Heribert
AU - Mundhenk, Martin
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 - 2009
Y1 - 2009
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-57849101516&partnerID=MN8TOARS
U2 - 10.1016/j.entcs.2008.12.040
DO - 10.1016/j.entcs.2008.12.040
M3 - Article
VL - 20
SP - 901
EP - 918
JO - Int. J. Found. Comput. Sci.
JF - Int. J. Found. Comput. Sci.
IS - 5
ER -