The Complexity of Satisfiability for Fragments of CTL and CTL⋆

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

To cite the version in the repository, please use this identifier: https://doi.org/10.15488/1518

Selected time period:

year: 
month: 

Sum total of downloads: 52




Thumbnail
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
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 image of flag of Germany Germany 46 88.46%
2 image of flag of United States United States 3 5.77%
3 image of flag of Latvia Latvia 1 1.92%
4 image of flag of China China 1 1.92%
5 image of flag of Brazil Brazil 1 1.92%

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.

Search the repository


Browse