Universal graphs and good for games automata: new tools for infinite duration games

DOI10.1007/978-3-030-17127-8_1OpenAlexW2931271882MaRDI QIDQ2289060

Nathanaël Fijalkow, Thomas Colcombet

Publication date: 28 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17127-8_1

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (10)

The Theory of Universal Graphs for Infinite Duration Games ⋮ Unnamed Item ⋮ A survey on satisfiability checking for the \(\mu \)-calculus through tree automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Quantitative vs. weighted automata ⋮ On satisficing in quantitative games ⋮ Quasipolynomial computation of nested fixpoints ⋮ Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games

This page was built for publication: Universal graphs and good for games automata: new tools for infinite duration games