The Community for Technology Leaders
Formal Methods and Models for Co-Design, ACM/IEEE International Conference on (2006)
Napa, CA, USA
July 27, 2006 to July 30, 2006
ISBN: 1-4244-0421-5
pp: 198
A. Banerjee , Dept. of Comput. Sci.&Eng., Indian Inst. of Technol., Kharagpur, India
P. Dasgupta , Dept. of Comput. Sci.&Eng., Indian Inst. of Technol., Kharagpur, India
P.P. Chakrabarti , Dept. of Comput. Sci.&Eng., Indian Inst. of Technol., Kharagpur, India
ABSTRACT
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.
INDEX TERMS
quantified Boolean formula, formal methods, realizability checking, three-party systems, multiplayer coalition games, coalition realizability problem, observability
CITATION

P. Dasgupta, P. Chakrabarti and A. Banerjee, "Formal methods for checking realizability of coalitions in 3-party systems," Formal Methods and Models for Co-Design, ACM/IEEE International Conference on(MEMOCODE), Napa, CA, USA, 2006, pp. 198.
doi:10.1109/MEMCOD.2006.1695927
92 ms
(Ver 3.3 (11022016))