The Modal μ-Calculus Caught Off Guard
From MaRDI portal
Publication:3010366
DOI10.1007/978-3-642-22119-4_13zbMath1333.03007MaRDI QIDQ3010366
Oliver Friedmann, Martin Lange
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22119-4_13
03B45: Modal logic (including the logic of norms)
03B35: Mechanization of proofs and logical operations
Related Items
Cites Work
- Results on the propositional \(\mu\)-calculus
- An automata theoretic decision procedure for the propositional mu- calculus
- Propositional dynamic logic of regular programs
- Infinite games played on finite graphs
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- A Tableau System for the Modal μ-Calculus
- The Complexity of Tree Automata and Logics of Programs
- An automata-theoretic approach to branching-time model checking
- Solving Parity Games in Big Steps
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item