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 条
12345