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...
Κύριοι συγγραφείς: | Benerecetti, M, Dell Erba, D, Mogavero, F |
---|---|
Μορφή: | Conference item |
Έκδοση: |
Springer
2016
|
Παρόμοια τεκμήρια
-
Improving Priority Promotion for Parity Games
ανά: Benerecetti, M, κ.ά.
Έκδοση: (2016) -
A delayed promotion policy for parity games
ανά: Benerecetti, M, κ.ά.
Έκδοση: (2016) -
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
ανά: Massimo Benerecetti, κ.ά.
Έκδοση: (2017-09-01) -
Smaller progress measures and separating automata for parity games
ανά: Daniele Dell'Erba, κ.ά.
Έκδοση: (2022-09-01) -
Solving parity games using an automata-based algorithm
ανά: Di Stasio, A, κ.ά.
Έκδοση: (2016)