Formal methods for checking realizability of coalitions in 3-party systems

Ansuman Banerjee, Pallab Dasgupta, P. P. Chakrabarti · 2006

The main contributions of this paper are as follows: We revisit the concept of multiplayer coalition games in the context of a 3-party system. We analyze the coalition realizability problem for different degrees of observability of the module and the controller. We show that the realizability problem can be expressed as an instance of quantified Boolean formulas (QBF), by using appropriate quantifications on the variables of the environment, the module and the controller. We then use recent QBF solvers to verify

Read the paper · More papers on PaperTik