The mu-calculus and Model Checking
- 19 May 2018
- book chapter
- Published by Springer Nature
- p. 871-919
Abstract
No abstract availableKeywords
This publication has 72 references indexed in Scilit:
- Entanglement and the complexity of directed graphsTheoretical Computer Science, 2012
- Parity games on undirected graphsInformation Processing Letters, 2012
- The Variable Hierarchy of the μ-Calculus Is StrictTheory of Computing Systems, 2007
- Definable operations in general algebras, and the theory of automata and flowcharts2006
- Quantitative solution of omega-regular gamesJournal of Computer and System Sciences, 2004
- Game Logic is Strong Enough for Parity GamesStudia Logica, 2003
- Theμ-calculus alternation-depth hierarchy is strict on binary treesRAIRO - Theoretical Informatics and Applications, 1999
- Modal Languages and Bounded Fragments of Predicate LogicJournal of Philosophical Logic, 1998
- Model checking and boolean graphsTheoretical Computer Science, 1994
- A linear algorithm to solve fixed-point equations on transition systemsInformation Processing Letters, 1988