Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:formal_semantics
gptkb:logic |
| gptkbp:application |
specification of recursive properties
|
| gptkbp:characteristic |
uses least and greatest fixed points
|
| gptkbp:complexity |
EXPTIME-complete
|
| gptkbp:decidability |
decidable
|
| gptkbp:expressivePower |
can express properties not definable in CTL or LTL
|
| gptkbp:field |
gptkb:theoretical_computer_science
gptkb:logic |
| gptkbp:generalizes |
gptkb:logic
|
| gptkbp:hasSyntax |
modal operators
fixed-point operators |
| gptkbp:introduced |
gptkb:Dexter_Kozen
|
| gptkbp:introducedIn |
1983
|
| gptkbp:notation |
μ and ν for least and greatest fixed points
|
| gptkbp:relatedTo |
automata theory
monadic second-order logic |
| gptkbp:usedIn |
model checking
verification of transition systems |
| https://www.w3.org/2000/01/rdf-schema#label |
propositional μ-calculus
|