Conference item icon

Conference item

Borel determinacy of concurrent games

Abstract:
Just as traditional games can be represented by trees, so concurrent games can be represented by event structures. We show the determinacy of such concurrent games with Borel sets of configurations as winning conditions, provided they are race-free and bounded-concurrent. Both properties are shown necessary. The determinacy proof proceeds via a reduction to the determinacy of tree games, and the determinacy of these in turn reduces to the determinacy of Gale-Stewart games.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-642-40184-8_36

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Publisher:
Springer, Berlin, Heidelberg Publisher's website
Host title:
CONCUR 2013: CONCUR 2013 – Concurrency Theory
Series:
Lecture Notes in Computer Science
Journal:
Lecture Notes in Computer Science Journal website
Volume:
8052
Pages:
516-530
Publication date:
2013-08-23
DOI:
ISSN:
0302-9743
ISBN:
9783642401831
Pubs id:
pubs:566664
UUID:
uuid:09a89817-7bea-4fc8-b761-4859e8772620
Local pid:
pubs:566664
Source identifiers:
566664
Deposit date:
2017-01-05

Terms of use


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