scientific article; zbMATH DE number 7439729

zbMath1478.68144MaRDI QIDQ5015267

Massimo Benerecetti, Fabio Mogavero, Daniele Dell'Erba

Publication date: 7 December 2021

Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2016.3

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

Robust worst cases for parity games algorithms ⋮ Solving mean-payoff games via quasi dominions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A delayed promotion policy for parity games

Uses Software

• PGSolver

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Positional strategies for mean payoff games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• The complexity of mean payoff games on graphs
• Automata, logics, and infinite games. A guide to current research
• Generalized Mean-payoff and Energy Games
• A Deterministic Subexponential Algorithm for Solving Parity Games
• Symmetric Strategy Improvement
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
• Solving Parity Games in Practice
• Solving Parity Games via Priority Promotion
• An automata-theoretic approach to branching-time model checking
• Solving Parity Games in Big Steps
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: