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...
| Hlavní autoři: | , , |
|---|---|
| Médium: | Conference item |
| Vydáno: |
Springer
2016
|