- Home
- →
- Fakultäten
- →
- Fakultät für Elektrotechnik und Informatik
- →
- View Item
Download statistics - Document (COUNTER):
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
Repository version
Selected time period:
Sum total of downloads: 230
| Abstract: | |
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. | |
| License of this version: | CC BY-NC-ND 3.0 Unported |
| Document Type: | Article |
| Publishing status: | publishedVersion |
| Issue Date: | 2008 |
| Appears in Collections: | Fakultät für Elektrotechnik und Informatik |
distribution of downloads over the selected time period:
downloads by country:
| pos. | country | downloads | ||
|---|---|---|---|---|
| total | perc. | |||
| 1 |  |
Germany | 154 | 66.96% |
| 2 |  |
United States | 40 | 17.39% |
| 3 |  |
China | 9 | 3.91% |
| 4 |  |
No geo information available | 5 | 2.17% |
| 5 |  |
Netherlands | 3 | 1.30% |
| 6 |  |
Ireland | 3 | 1.30% |
| 7 |  |
United Kingdom | 3 | 1.30% |
| 8 |  |
Sweden | 2 | 0.87% |
| 9 |  |
Taiwan | 1 | 0.43% |
| 10 |  |
Portugal | 1 | 0.43% |
| other countries | 9 | 3.91% | ||
Further download figures and rankings:
Hinweis
Zur Erhebung der Downloadstatistiken kommen entsprechend dem „COUNTER Code of Practice for e-Resources“ international anerkannte Regeln und Normen zur Anwendung. COUNTER ist eine internationale Non-Profit-Organisation, in der Bibliotheksverbände, Datenbankanbieter und Verlage gemeinsam an Standards zur Erhebung, Speicherung und Verarbeitung von Nutzungsdaten elektronischer Ressourcen arbeiten, welche so Objektivität und Vergleichbarkeit gewährleisten sollen. Es werden hierbei ausschließlich Zugriffe auf die entsprechenden Volltexte ausgewertet, keine Aufrufe der Website an sich.