Partial solvers for generalized parity games

DOI10.1007/978-3-030-30806-3_6OpenAlexW2971377472MaRDI QIDQ2330591FDOQ2330591

Authors: Véronique Bruyère, G. A. Pérez, Jean-François Raskin, Clément Tamines 

Publication date: 22 October 2019

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

Recommendations

• Partial solvers for parity games: effective polynomial-time composition
• Solving parity games in practice
• Static analysis of parity games: alternating reachability under parity
• Generalized Parity Games
• A comparison of BDD-based parity game solvers

zbMATH Keywords

parity gamesgeneralized parity gamespartial solvers

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Cited In (5)

• A Multi-Core Solver for Parity Games
• Generalized Parity Games
• Improving parity game solvers with justifications
• On-the-fly solving for symbolic parity games
• Synthesizing permissive winning strategy templates for parity games

This page was built for publication: Partial solvers for generalized parity games

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