期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2010
卷号：25
页码：146-161
DOI：10.4204/EPTCS.25.15
出版社：Open Publishing Association
摘要：This work studies the following question: can plays in a Muller game be stopped after a finite number of moves and a winner be declared. A criterion to do this is sound if Player 0 wins an infinite-duration Muller game if and only if she wins the finite-duration version. A sound criterion is presented that stops a play after at most 3^n moves, where n is the size of the arena. This improves the bound (n!+1)^n obtained by McNaughton and the bound n!+1 derived from a reduction to parity games.
关键词：This work studies the following question: can plays in a Muller game be stopped ;after a finite number of moves and a winner be declared. A criterion to do this ;is sound if Player 0 wins an infinite-duration Muller game if and only if she ;wins the finite-duration version. A sound criterion is presented that stops a ;play after at most 3^n moves; where n is the size of the arena. This improves ;the bound (n!+1)^n obtained by McNaughton and the bound n!+1 derived from a ;reduction to parity games.
