Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
From MaRDI portal
Publication:6647769
DOI10.1016/J.IC.2024.105233MaRDI QIDQ6647769
Tommaso Padoan, Paolo Baldan, Barbara König
Publication date: 3 December 2024
Published in: Information and Computation (Search for Journal in Brave)
\(\mu\)-calculuscomplete latticesparity gamesabstract interpretationlocal algorithmsbisimilarityup-to techniquesfixpoint equation systems
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Results on the propositional \(\mu\)-calculus
- Constructive versions of Tarski's fixed point theorems
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Fast and simple nested fixpoints
- Quasipolynomial computation of nested fixpoints
- Parameterised Boolean equation systems
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- A lattice-theoretical fixpoint theorem and its applications
- Lattice-theoretic progress measures and coalgebraic model checking
- Two local strategy iteration schemes for parity game solving
- The power of parameterization in coinductive proof
- Checking NFA equivalence with bisimulations up to congruence
- Model checking of probabilistic and nondeterministic systems
- Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation
- The mu-calculus and Model Checking
- Complete Lattices and Up-To Techniques
- Solving Parity Games in Practice
- Łukasiewicz μ-calculus
- Coinduction All the Way Up
- Deciding parity games in quasipolynomial time
- Up-To Techniques for Behavioural Metrics via Fibrations
- Sound up-to techniques and Complete abstract domains
- A modal μ perspective on solving parity games in quasi-polynomial time
- Temporal abstract interpretation
- Making abstract interpretations complete
- On-the-fly solving for symbolic parity games
This page was built for publication: Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647769)
