Parosh Aziz Abdulla, Ahmed Bouajjani & Julien d'Orso (2008):
Monotonic and Downward Closed Games.
J. Log. Comput. 18(1),
pp. 153–169,
doi:10.1093/logcom/exm062.
Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani & Bengt Jonsson (2004):
Using Forward Reachability Analysis for Verification of Lossy Channel Systems.
FMSD 25(1),
pp. 39–65,
doi:10.1023/B:FORM.0000033962.51898.1a.
Parosh Aziz Abdulla & Bengt Jonsson (1996):
Undecidable Verification Problems for Programs with Unreliable Channels.
Inf. Comput. 130(1),
pp. 71–90,
doi:10.1006/inco.1996.0083.
K. Chatterjee, L. Doyen, T. A. Henzinger & J.-F. Raskin (2006):
Algorithms for Omega-Regular Games with Imperfect Information.
In: Proc. CSL'06,
LNCS 4207.
Springer,
pp. 287–302,
doi:10.1007/11874683_19.
M. De Wulf, L. Doyen & J.-F. Raskin (2006):
A Lattice Theory for Solving Games of Imperfect Information.
In: Proc. HSCC'06,
LNCS 3927.
Springer,
pp. 153–168,
doi:10.1007/11730637_14.
Alberto Marcone (2001):
Fine Analysis of the Quasi-Orderings on the Power Set.
Order 18(4),
pp. 339–347,
doi:10.1023/A:1013952225669.
E. C. Milner (1985):
Basic Wqo- and Bqo-Theory.
In: Graphs and order,
pp. 487–502,
doi:10.1007/978-94-009-5315-4_14.
C. Nash-Williams (1965):
On well-quasi ordering infinite trees.
Proceedings of the Cambridge Philosophical Society 61,
pp. 697–720,
doi:10.1017/S0305004100039062.
John H. Reif (1984):
The Complexity of Two-Player Games of Incomplete Information.
J. Comput. Syst. Sci. 29(2),
pp. 274–301,
doi:10.1016/0022-0000(84)90034-5.