In an earlier work [Abdulla et al. (2000, Information and Computation, 160, 109-127)] we presented a general framework for verification of infinite-state transition systems, where the transition relation is monotonic with respect to a well quasi-ordering on the set of states. In this article, we investigate extending the framework from the context of transition systems to that of games with infinite state spaces. We show that monotonic games with safety winning conditions are in general undecidable. In particular, we show this negative results for games which are defined over Petri nets. We identify a subclass of monotonic games, called downward closed games. We provide algorithms for analysing downward closed games subject to safety winning conditions. We apply the algorithm to games played on lossy channel systems. Finally, we show that weak parity games are undecidable for the above classes of games.
A general framework for games over infinite-state systems with a well-quasi ordering is introduced in REF and the restriction of downward closure is imposed to get decidability.
Monotonic and downward closed games
Journal of Logic and Computation
Mathematics Computer Science