Solving parity games: explicit vs symbolic

DOI10.1007/978-3-319-94812-6_14MaRDI QIDQ1616970zbMATH OpenOpenAlexFDO

Authors Antonio Di Stasio, Aniello Murano, Moshe Y. Vardi

Publication date 7 November 2018

Full work available at URL http://hdl.handle.net/11573/1400022

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Solving parity games in practice
• Quasipolynomial set-based symbolic algorithms for parity games
• Improving parity games in practice
• Improved set-based symbolic algorithms for parity games
• Solving parity games via priority promotion

Cited in

(9)

• Quasipolynomial set-based symbolic algorithms for parity games
• Solving parity games by a reduction to SAT
• Improving parity game solvers with justifications
• On-the-fly solving for symbolic parity games
• scientific article; zbMATH DE number 7455738 (Why is no real title available?)
• Improving parity games in practice
• Improved set-based symbolic algorithms for parity games
• Certifying inexpressibility
• Solving μ-Calculus Parity Games by Symbolic Planning

This page was built for publication: Solving parity games: explicit vs symbolic

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