Minimisation of ATL * models - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Minimisation of ATL * models


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.
No file

Dates and versions

hal-01599160 , version 1 (01-10-2017)



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⟩
110 View
0 Download



Gmail Facebook X LinkedIn More