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...
Main Authors: | Benerecetti, M, Dell Erba, D, Mogavero, F |
---|---|
Format: | Conference item |
Izdano: |
Springer
2016
|
Podobne knjige/članki
-
Improving Priority Promotion for Parity Games
od: Benerecetti, M, et al.
Izdano: (2016) -
A delayed promotion policy for parity games
od: Benerecetti, M, et al.
Izdano: (2016) -
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
od: Massimo Benerecetti, et al.
Izdano: (2017-09-01) -
Smaller progress measures and separating automata for parity games
od: Daniele Dell'Erba, et al.
Izdano: (2022-09-01) -
Generating and Solving Symbolic Parity Games
od: Gijs Kant, et al.
Izdano: (2014-07-01)