Details
Original language | English |
---|---|
Title of host publication | Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008) |
Pages | 201-213 |
Number of pages | 13 |
Volume | 223 |
Publication status | Published - 2008 |
Publication series
Name | Electron. Notes Theor. Comput. Sci. |
---|
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
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 proceeding › Conference contribution › Research › peer review
}
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 -