[PDF][PDF] The theory of universal graphs for infinite duration games
T Colcombet, N Fijalkow… - Logical Methods in …, 2022 - lmcs.episciences.org
We introduce the notion of universal graphs as a tool for constructing algorithms solving
games of infinite duration such as parity games and mean payoff games. In the first part we …
games of infinite duration such as parity games and mean payoff games. In the first part we …
Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games
P Parys, A Wiącek - Conference on Computability in Europe, 2023 - Springer
We improve the complexity of solving parity games (with priorities in vertices) for d= ω (log n)
by a factor of Θ (d 2): the best complexity known to date was O (mdn 1.45+ log 2 (d/log 2 n)) …
by a factor of Θ (d 2): the best complexity known to date was O (mdn 1.45+ log 2 (d/log 2 n)) …
[图书][B] Unity of Logic and Computation: 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023, Proceedings
The conference Computability in Europe (CiE) is organized yearly under the auspices of the
Association CiE, a European association of mathematicians, logicians, computer scientists …
Association CiE, a European association of mathematicians, logicians, computer scientists …
Solving Parity Games: Combining Progress Measures and Tangle Learning
AV Stekelenburg - 2024 - essay.utwente.nl
An oft-used method for verifying the correctness of software is model checking. One
technique for performing model checking involves converting a model and specification into …
technique for performing model checking involves converting a model and specification into …
Unity of Logic and Computation LNCS 13967
The conference Computability in Europe (CiE) is organized yearly under the auspices of the
Association CiE, a European association of mathematicians, logicians, computer scientists …
Association CiE, a European association of mathematicians, logicians, computer scientists …