Conference item icon

Conference item

Solving parity games using an automata-based algorithm

Abstract:

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 according to the parities (even or odd) of the minimal priority occurring infinitely often in that play. The problem of finding a winning strategy in parity games is known to be in UPTime ∩ CoUPTime and ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-319-40946-7_6

Authors


More by this author
Department:
Oxford, MPLS, Computer Science
Role:
Author
Publisher:
Springer Verlag Publisher's website
Volume:
9705
Pages:
64-76
Series:
Lecture Notes in Computer Science
Publication date:
2016-07-06
Acceptance date:
2016-04-20
DOI:
ISSN:
0302-9743 and 1611-3349
Pubs id:
pubs:620008
URN:
uri:d48969e2-fa8b-4e4b-b188-ecfb5dee883c
UUID:
uuid:d48969e2-fa8b-4e4b-b188-ecfb5dee883c
Local pid:
pubs:620008
ISBN:
9783319409450

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP