On the expressivity of the modal mu-calculus

DOI10.1007/3-540-60922-9_39zbMath1379.68155OpenAlexW1597993550MaRDI QIDQ4593954

Julian Bradfield

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_39

zbMATH Keywords

verificationtemporal logiclogic in computer sciencedescriptive complexity

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Descriptive complexity and finite models (68Q19)

Related Items (7)

On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic ⋮ Mu-depth 3 is more than 2: a game-theoretic proof ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ Fixpoint alternation: arithmetic, transition systems, and the binary tree ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ EXPTIME Tableaux for the Coalgebraic μ-Calculus ⋮ Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting

This page was built for publication: On the expressivity of the modal mu-calculus