Deciding the unguarded modal -calculus
From MaRDI portal
Publication:4583323
DOI10.1080/11663081.2013.861181zbMath1398.03092OpenAlexW2049154590MaRDI QIDQ4583323
Martin Lange, Oliver Friedmann
Publication date: 28 August 2018
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/11663081.2013.861181
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (4)
Parity game reductions ⋮ A survey on satisfiability checking for the \(\mu \)-calculus through tree automata ⋮ Quasipolynomial computation of nested fixpoints ⋮ NP reasoning in the monotone \(\mu\)-calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Game logic is strong enough for parity games
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
- A Tableau System for the Modal μ-Calculus
- The Complexity of Tree Automata and Logics of Programs
- Monadic second order logic on tree-like structures
- On guarded transformation in the modal -calculus
- 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
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication: Deciding the unguarded modal -calculus
