Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • Three notes on the complexity of model checking fixpoint logic with chop

  • Martin Lange
  • Journal:
    RAIRO - Theoretical Informatics and Applications / Volume 41 / Issue 2 / April 2007
    Published online by Cambridge University Press:
    18 July 2007, pp. 177-190
    Print publication:
    April 2007

  • This paper analyses the complexity of model checking fixpoint logic with Chop – an extension of themodal μ-calculus with a sequential composition operator. It uses two known game-based characterisationsto derive the following results: the combined model checking complexity as well as the data complexity of FLC are EXPTIME-complete. This is already the case for its alternation-free fragment. The expressioncomplexity of FLC is trivially P-hard and limited from above by the complexity of solving a parity game, i.e. in UP ∩ co-UP. For any fragment of fixed alternation depth, in particular alternation-free formulas it is P-complete.