Simple fixpoint iteration to solve parity games

MaRDI QIDQ5020529FDOQ5020529

Authors: Tom van Dijk, Bob Rubbens 

Publication date: 6 January 2022

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

Recommendations

• The fixpoint-iteration algorithm for parity games
• Two local strategy iteration schemes for parity game solving
• Solving parity games in practice
• scientific article; zbMATH DE number 1670778
• Quasipolynomial computation of nested fixpoints

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Solving parity games in practice
• Strix
• Solving parity games using an automata-based algorithm
• Results on the propositional \(\mu\)-calculus
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• On model checking for the \(\mu\)-calculus and its fragments
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monadic second order logic on tree-like structures
• Title not available (Why is that?)
• Succinct progress measures for solving parity games
• The mu-calculus and Model Checking
• Solving parity games via priority promotion
• Attracting tangles to solve parity games
• The fixpoint-iteration algorithm for parity games
• Certification for \(\mu \)-calculus with winning strategies

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Justifications and a reconstruction of parity game solving algorithms

Uses Software

• PGSolver
• Strix
• Oink

This page was built for publication: Simple fixpoint iteration to solve parity games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020529)