Bounded game-theoretic semantics for modal mu-calculus
From MaRDI portal
Publication:2105468
DOI10.1016/J.IC.2022.104882OpenAlexW4213354471WikidataQ114014308 ScholiaQ114014308MaRDI QIDQ2105468FDOQ2105468
Authors: Lauri Hella, Antti Kuusisto, Raine Rönnholm 
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
mu-calculusgame-theoretic semanticsmodel-checkingalternative semanticsclosure ordinalsbounded semanticsfixed point approximants
Cites Work
- Title not available (Why is that?)
- Results on the propositional \(\mu\)-calculus
- Title not available (Why is that?)
- An automata theoretic decision procedure for the propositional mu- calculus
- Title not available (Why is that?)
- Permissive strategies: from parity games to safety games
- Title not available (Why is that?)
- Bounded semantics
- First-cycle games
- Title not available (Why is that?)
- Games for the \(\mu\)-calculus
- Some Turing-complete extensions of first-order logic
- Succinct progress measures for solving parity games
- The mu-calculus and Model Checking
- On closure ordinals for the modal \(\mu\)-calculus
- Asynchronous distributed automata: a characterization of the modal \(\mu\)-fragment
- Deciding parity games in quasipolynomial time
- Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
- Alternating-time temporal logic ATL with finitely bounded semantics
- Game-Theoretic Semantics for Alternating-Time Temporal Logic
- Formula size games for modal logic and \(\mu\)-calculus
- STACS 2004
- From Liveness to Promptness
- CTL with finitely bounded semantics
Cited In (5)
This page was built for publication: Bounded game-theoretic semantics for modal mu-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105468)
