Quasipolynomial computation of nested fixpoints
From MaRDI portal
Publication:2044189
DOI10.1007/978-3-030-72016-2_3zbMath1467.68085arXiv1907.07020OpenAlexW3147573360MaRDI QIDQ2044189
Lutz Schröder, Daniel Hausmann
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1907.07020
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Universal algorithms for parity games and nested fixpoints, Quasipolynomial computation of nested fixpoints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Fast and simple nested fixpoints
- An improved algorithm for the evaluation of fixpoint expressions
- Universal coalgebra: A theory of systems
- Energy parity games
- Automata, logics, and infinite games. A guide to current research
- Quasipolynomial computation of nested fixpoints
- Universal graphs and good for games automata: new tools for infinite duration games
- Optimal satisfiability checking for arithmetic \(\mu\)-calculi
- Lattice-theoretic progress measures and coalgebraic model checking
- On the equivalence of game and denotational semantics for the probabilistic mu-calculus
- EXPTIME Tableaux for the Coalgebraic mu-Calculus
- Alternating-time temporal logic
- Latticed Simulation Relations and Games
- The Descriptive Complexity of Parity Games
- Concurrent dynamic logic
- Deciding the unguarded modal -calculus
- Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras
- Deciding parity games in quasipolynomial time
- On the Way to Alternating Weak Automata
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- A modal μ perspective on solving parity games in quasi-polynomial time
- Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
- Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
- Verification: Theory and Practice
- Automata, Languages and Programming
- On model checking for the \(\mu\)-calculus and its fragments
