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

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Meier, A
  • Mundhenk, M
  • Schneider, T
  • Thomas, M
  • Vollmer, H
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
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 07 Dec 2012 12:25
Last Modified: 18 Sep 2016 15:52
Status: Published
Publisher: International Federation of Computational Logic
Identification Number: 10.2168/LMCS-7(2:12)2011

Download

Filename: LMCS11-CTL.pdf

Share / Export

Statistics