The Modal μ-Calculus Caught Off Guard
From MaRDI portal
Publication:3010366
DOI10.1007/978-3-642-22119-4_13zbMATH Open1333.03007OpenAlexW143189931MaRDI QIDQ3010366FDOQ3010366
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
Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)
Cites Work
- Propositional dynamic logic of regular programs
- Modal logics and mu-calculi: An introduction
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- The Complexity of Tree Automata and Logics of Programs
- Results on the propositional \(\mu\)-calculus
- An automata-theoretic approach to branching-time model checking
- Infinite games played on finite graphs
- Solving Parity Games in Big Steps
- An automata theoretic decision procedure for the propositional mu- calculus
- Title not available (Why is that?)
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Tableau System for the Modal μ-Calculus
Cited In (4)
This page was built for publication: The Modal μ-Calculus Caught Off Guard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010366)