Summary: Monotonic and Downward Closed
Games #
Parosh Aziz Abdulla
Uppsala University, Sweden
Ahmed Bouajjani
University of Paris 7, France
Julien d'Orso
University of Paris 7, France
Abstract
In an earlier work [A Ÿ
CJYK00] we presented a general framework for
verification of infinite­state transition systems, where the transition re­
lation is monotonic with respect to a well quasi­ordering on the set of
states. In this paper, we investigate extending the framework from the
context of transition systems to that of games with infinite state spaces.
We show that monotonic games are in general undecidable. We identify
a subclass of monotonic games, called downward closed games. We pro­
vide algorithms for analyzing downward closed games subject to winning
conditions which are formulated as safety properties.
1 Introduction

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

Collections: Computer Technologies and Information Sciences