Symbolic model checking for μ-calculus requires exponential time

A. Rabinovich

doi:10.1016/S0304-3975(00)00033-5

Symbolic model checking for μ-calculus requires exponential time

A. Rabinovich^*

^*Corresponding author for this work

School of Computer Science and AI

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

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 language	English
Pages (from-to)	467-475
Number of pages	9
Journal	Theoretical Computer Science
Volume	243
Issue number	1-2
DOIs	https://doi.org/10.1016/S0304-3975(00)00033-5
State	Published - 28 Jul 2000

Keywords

Complexity
Model checking
μ-calculus

Access to Document

10.1016/S0304-3975(00)00033-5

Cite this

@article{1d86c9ab8f49491aabe30621fef8422e,

title = "Symbolic model checking for μ-calculus requires exponential time",

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.",

keywords = "Complexity, Model checking, μ-calculus",

author = "A. Rabinovich",

year = "2000",

month = jul,

day = "28",

doi = "10.1016/S0304-3975(00)00033-5",

language = "אנגלית",

volume = "243",

pages = "467--475",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Symbolic model checking for μ-calculus requires exponential time

AU - Rabinovich, A.

PY - 2000/7/28

Y1 - 2000/7/28

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

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

KW - Complexity

KW - Model checking

KW - μ-calculus

UR - https://www.scopus.com/pages/publications/0010399514

U2 - 10.1016/S0304-3975(00)00033-5

DO - 10.1016/S0304-3975(00)00033-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0010399514

SN - 0304-3975

VL - 243

SP - 467

EP - 475

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

Symbolic model checking for μ-calculus requires exponential time

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this