  In this paper, we propose an Integer Linear Model whose solutions are the
aperiodic rhythms tiling with a given rhythm A. We show how this model can be
used to efficiently check the necessity of the Coven-Meyerowitz's $(T2)$
condition and also to define an iterative algorithm that finds all the possible
tilings of the rhythm A. To conclude, we run several experiments to validate
the time efficiency of this model.
