Symbolic model checking for μ-calculus requires exponential time

A. Rabinovich*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We investigate the complexity of symbolic model checking for μ-calculus. The exponential time lower bound is proved. Moreover, this lower bound holds even for a fixed alternation-free formula.

Original languageEnglish
Pages (from-to)467-475
Number of pages9
JournalTheoretical Computer Science
Volume243
Issue number1-2
DOIs
StatePublished - 28 Jul 2000

Keywords

  • Complexity
  • Model checking
  • μ-calculus

Fingerprint

Dive into the research topics of 'Symbolic model checking for μ-calculus requires exponential time'. Together they form a unique fingerprint.

Cite this