Global Caching for the Alternation-free µ-Calculus

DOI10.4230/LIPIcs.CONCUR.2016.34zbMath1392.68301arXiv1609.06379OpenAlexW2963082232MaRDI QIDQ4608687

Lutz Schröder, Christoph Egger, Daniel Hausmann

Publication date: 21 March 2018

Full work available at URL: https://arxiv.org/abs/1609.06379

zbMATH Keywords

modal logicsatisfiabilitycoalgebraic logicBüchi gamesfixpoint logicglobal caching

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical logic, topoi (03G30) Temporal logic (03B44)

Related Items (1)

NP reasoning in the monotone \(\mu\)-calculus

This page was built for publication: Global Caching for the Alternation-free µ-Calculus