Solving parity games using an automata-based algorithm
Parity games are abstract infinite-round games that take an important role in formal verification. In the basic setting, these games are two-player, turn-based, and played under perfect information on directed graphs, whose nodes are labeled with priorities. The winner of a play is determined accord...
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Conference item |
| 出版事項: |
Springer Verlag
2016
|