Minimisation of ATL * models

International audienceThe aim of this work is to provide a general method to minimize the size (number of states) of a model M of an ATL* formula. Our approach is founded on the notion of alternating bisimulation: given a model M it is transformed in a stepwise manner into a new model M’ minimal with respect to bisimulation. The method has been implemented and will be integrated into the prover TATL, that constructively decides satifiability of an ATL formula by building a tableau from which, when open, models of the input formula can be extracted