Fast filtering events for the Cherenkov Telescope Array

The most relevant result of this thesis work is the development of a first-level trigger to fast filtering events for the Cherenkov Telescope Array (CTA) project. After a depth study of the discrimination events problem, which allowed to develop a filter working with two original algorithms called FCTA-R and FCTA-N. The first one, FCTA-R, consists essentially in a criteria to ``cut'' the absolute time-line, in intervals of time, each of them containing at least one ore more events but with the strong condition that no event is divided into different time-box. The second one, FCTA-N, is a original Network Filter Algorithm, which trasforms a compatibility matrix, well defined between the delays matrices in a network and than evolves the systems obtaining a clustering effect. The cluster corresponds at the simulated physical events. All this procedure is innovative and probably never used first in CTA data analysis. Finally we tested our filter onto Official ASTRI-MC data. Obtaining a very good performance with a purity of about 99.8% and the highest efficiency obtainable with the same purity. The deployment of the algorithm on a GPU system, made possible by the FCTA-R condition and it is probably the our next step.