Memoryless determinacy of infinite parity games: Another simple proof

被引：0
|
作者：
Le Roux, Stephane [1 ]
机构：
[1] Tech Univ Darmstadt, Fachbereich Math, Darmstadt, Germany
来源：
INFORMATION PROCESSING LETTERS | 2019年 / 143卷
关键词：
Formal methods; Positional determinacy; Finitely many priorities; Infinite graph; (Transfinite) induction;
D O I：
10.1016/j.ipl.2018.10.015
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In 1998 Zielonka simplified the proofs of memoryless determinacy of infinite parity games. In 2018 Haddad simplified some proofs of memoryless determinacy of finite parity games. This article adapts Haddad's technique for infinite parity games. Two proofs are given, a shorter one and a more constructive one. None of them uses Zielonka's traps and attractors. (C) 2018 Published by Elsevier B.V.
引用
收藏
页码：8 / 13
页数：6
相关论文
共 50 条
  • [1] Memoryless determinacy of finite parity games: Another simple proof
    Haddad, Serge
    INFORMATION PROCESSING LETTERS, 2018, 132 : 19 - 21
  • [2] Memoryless determinacy of parity and mean payoff games:: a simple proof
    Björklund, H
    Sandberg, S
    Vorobyov, S
    THEORETICAL COMPUTER SCIENCE, 2004, 310 (1-3) : 365 - 378
  • [3] Memoryless determinacy of parity games
    Küsters, R
    AUTOMATA, LOGICS, AND INFINITE GAMES: A GUIDE TO CURRENT RESEARCH, 2002, 2500 : 95 - 106
  • [4] Positional determinacy of infinite games
    Grädel, E
    STACS 2004, PROCEEDINGS, 2004, 2996 : 4 - 18
  • [5] THE DETERMINACY OF INFINITE GAMES WITH EVENTUAL PERFECT MONITORING
    Shmaya, Eran
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2011, 139 (10) : 3665 - 3678
  • [6] Half-positional determinacy of infinite games
    Kopczynski, Eryk
    AUTOMATA, LANGAGES AND PROGRAMMING, PT 2, 2006, 4052 : 336 - 347
  • [7] Parity and exploration games on infinite graphs
    Gimbert, H
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2004, 3210 : 56 - 70
  • [8] DETERMINACY IN DISCRETE-BIDDING INFINITE-DURATION GAMES
    Aghajohari, Milad
    Avni, Guy
    Henzinger, Thomas A.
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (01) : 10:1 - 10:23
  • [9] On the determinacy of concurrent games on event structures with infinite winning sets
    Gutierrez, Julian
    Winskel, Glynn
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (06) : 1119 - 1137
  • [10] Simple stochastic parity games
    Chatterjee, K
    Jurdzinski, M
    Henzinger, TA
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2003, 2803 : 100 - 113
12345