Bounded game-theoretic semantics for modal mu-calculus

DOI10.1016/j.ic.2022.104882OpenAlexW4213354471WikidataQ114014308 ScholiaQ114014308MaRDI QIDQ2105468

Raine Rönnholm, Antti Kuusisto, Lauri Hella

Publication date: 8 December 2022

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

model-checkingmu-calculusgame-theoretic semanticsalternative semanticsclosure ordinalsbounded semanticsfixed point approximants

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded semantics
• First-cycle games
• Games for the \(\mu\)-calculus
• Results on the propositional \(\mu\)-calculus
• An automata theoretic decision procedure for the propositional mu- calculus
• Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
• Alternating-time temporal logic ATL with finitely bounded semantics
• On closure ordinals for the modal mu−calculus
• The mu-calculus and Model Checking
• Game-Theoretic Semantics for Alternating-Time Temporal Logic
• Permissive strategies: from parity games to safety games
• Deciding parity games in quasipolynomial time
• Some Turing-Complete Extensions of First-Order Logic
• Formula size games for modal logic and μ-calculus
• STACS 2004
• From Liveness to Promptness

This page was built for publication: Bounded game-theoretic semantics for modal mu-calculus