Skip to Main content Skip to Navigation
Conference papers

Minimisation of ATL * models

Abstract : The 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Sunday, October 1, 2017 - 6:18:23 PM
Last modification on : Saturday, May 1, 2021 - 3:51:13 AM



Serenella Cerrito, Amélie David. Minimisation of ATL * models. 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2017), Sep 2017, Brasilia, Brazil. pp.193--208, ⟨10.1007/978-3-319-66902-1_12⟩. ⟨hal-01599160⟩



Record views