Solving parity games via priority promotion
We consider parity games, a special form of two-player infinite-duration games on numerically labelled graphs, whose winning condition requires that the maximal value of a label occurring infinitely often during a play be of some specific parity. The problem has a rather intriguing status from a com...
Autors principals: | Benerecetti, M, Dell Erba, D, Mogavero, F |
---|---|
Format: | Conference item |
Publicat: |
Springer
2016
|
Ítems similars
-
Improving Priority Promotion for Parity Games
per: Benerecetti, M, et al.
Publicat: (2016) -
A delayed promotion policy for parity games
per: Benerecetti, M, et al.
Publicat: (2016) -
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
per: Massimo Benerecetti, et al.
Publicat: (2017-09-01) -
Smaller progress measures and separating automata for parity games
per: Daniele Dell'Erba, et al.
Publicat: (2022-09-01) -
Solving parity games using an automata-based algorithm
per: Di Stasio, A, et al.
Publicat: (2016)