- Startseite
- →
- Fakultäten
- →
- Fakultät für Elektrotechnik und Informatik
- →
- Dokumentanzeige
JavaScript is disabled for your browser. Some features of this site may not work without it.
Originalpublikation
Meier, Arne; Mundhenk, M.; Thomas, Michael; Vollmer, Heribert: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. In: Electronic Notes in Theoretical Computer Science 223 (2008), Nr. C, S. 201-213. DOI: https://doi.org/10.1016/j.entcs.2008.12.040
Version im Repositorium
Zum Zitieren der Version im Repositorium verwenden Sie bitte diesen DOI:
https://doi.org/10.15488/1518
| Zusammenfassung: | |
|
The satisfiability problems for CTL and CTL⋆ are known to be EXPTIME-complete, resp. 2EXPTIME-complete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that use less temporal or propositional operators, the complexity may decrease. This paper undertakes a systematic study of satisfiability for CTL- and CTL⋆-formulae over restricted sets of propositional and temporal operators. We show that restricting the temporal operators yields satisfiability problems complete for 2EXPTIME, EXPTIME, PSPACE, and NP. Restricting the propositional operators either does not change the complexity (as determined by the temporal operators), or yields very low complexity like NC1, TC0, or NLOGTIME.
|
|
| Lizenzbestimmungen: | CC BY-NC-ND 3.0 Unported - https://creativecommons.org/licenses/by-nc-nd/3.0/ |
| Publikationstyp: | Article |
| Publikationsstatus: | publishedVersion |
| Erstveröffentlichung: | 2008 |
| Schlagwörter (englisch): | Post's Lattice, Satisfiability, Temporal Logic, Real time systems, Post's Lattice, Satisfiability, Satisfiability problems, Systematic studies, Temporal operators, Very low complexities, Temporal logic |
| Fachliche Zuordnung (DDC): | 004 | Informatik |
Die Publikation erscheint in Sammlung(en):
-
Fakultät für Elektrotechnik und Informatik
Frei zugängliche Publikationen aus der Fakultät für Elektrotechnik und Informatik