Beyersdorff, Olaf; Meier, Arne; Mundhenk, M.; Schneider, T.; Thomas, Michael et al.: Model checking CTL is almost always inherently sequential. In: Logical Methods in Computer Science 7 (2011), Nr. 2, 12. DOI: http://dx.doi.org/10.2168/LMCS-7(2:12)2011
Abstract: | |
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations-restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator, we systematically prove model checking to be either inherently sequential (P-complete) or very efficiently parallelizable (LOGCFL-complete). For most fragments, however, model checking for CTL is already P-complete. Hence our results indicate that, in cases where the combined complexity is of relevance, approaching CTL model checking by parallelism cannot be expected to result in any significant speedup. We also completely determine the complexity of the model checking problem for all fragments of the extensions ECTL, CTL+, and ECTL+. | |
License of this version: | CC BY-ND 2.0 Unported |
Document Type: | Article |
Publishing status: | publishedVersion |
Issue Date: | 2011 |
Appears in Collections: | Fakultät für Elektrotechnik und Informatik |
pos. | country | downloads | ||
---|---|---|---|---|
total | perc. | |||
1 | Germany | 105 | 66.88% | |
2 | United States | 31 | 19.75% | |
3 | China | 8 | 5.10% | |
4 | Russian Federation | 3 | 1.91% | |
5 | No geo information available | 1 | 0.64% | |
6 | Taiwan | 1 | 0.64% | |
7 | Netherlands | 1 | 0.64% | |
8 | Moldova, Republic of | 1 | 0.64% | |
9 | Israel | 1 | 0.64% | |
10 | Switzerland | 1 | 0.64% | |
other countries | 4 | 2.55% |
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.