White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Model Checking CTL is Amost Always Inherently Sequential

Beyersdorff, O, Meier, A, Mundhenk, M, Schneider, T, Thomas, M and Vollmer, H (2011) Model Checking CTL is Amost Always Inherently Sequential. Logical Methods in Computer Science, 7 (2). ISSN 1860-5974

Full text available as:
[img]
Preview
Text
LMCS11-CTL.pdf
Available under License : See the attached licence file.

Download (382Kb)

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+.

Item Type: Article
Copyright, Publisher and Additional Information: © 2011 Beyersdorff et al; licensee IfCoLoq. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Keywords: Model checking, temporal logic, complexity
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science
Depositing User: Symplectic Publications
Date Deposited: 07 Dec 2012 12:25
Last Modified: 08 Feb 2013 17:41
Status: Published
Publisher: International Federation of Computational Logic
Identification Number: 10.2168/LMCS-7(2:12)2011
URI: http://eprints.whiterose.ac.uk/id/eprint/74437

Actions (login required)

View Item View Item