Modal logics and mu-calculi: An introduction (Q2760241)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Modal logics and mu-calculi: An introduction |
scientific article; zbMATH DE number 1684396
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modal logics and mu-calculi: An introduction |
scientific article; zbMATH DE number 1684396 |
Statements
7 January 2003
0 references
modal mu-calculus
0 references
model-checking
0 references
CTL
0 references
Modal logics and mu-calculi: An introduction (English)
0 references
At the beginning a brief survey of modal logics, such as Hennessy-Milner logic, PDL and CTL, is given. Then mu-calculus is introduced, which includes fixpoints as recursion, approximating fixpoints, calculus syntax and semantics. Next, the theory of modal mu-calculus is presented, which includes fixpoint regeneration and the fundamental semantics theorem, the finite model property and decidability, axiomatization, and the approximant approach to model-checking of finite systems. Also other model-checking techniques as local model-checking and model-checking for infinite systems are discussed. The relationship of modal mu-calculus to other formalisms, in particular automata and games, is briefly mentioned.NEWLINENEWLINEFor the entire collection see [Zbl 0971.00006].
0 references