In this paper we propose finding winning strategies of abstract games as an approach to verification problems which permits botyh a variable level of abstraction and on-the-fly exploraton.We describe a geenric alogirhtm which,when instantiated with certain functions specific to the ocncrete game,computes a winning strategy.We apply this technique to bisimulation and model-checking of value-passing proceses,and to timed automata.
展开▼
