Konferans bildirisi Açık Erişim

Synchronizing Heuristics: Speeding up the Slowest

2017    Altun, Omer Faruk; Atam, Kamil Tolga; Karahoda, Sertac; Kaya, Kamer

Computing a shortest synchronizing word of an automaton is an NP-hard problem. Therefore, heuristics are used to compute short synchronizing words. SYNCHROP is among the best heuristics in the literature in terms of word lengths. The heuristic and its variants such as SYNCHROPL have been frequently used as a baseline to judge the quality of the words generated by the new heuristics. Although, its quality is good, the heuristics are significantly slow especially compared to much cheaper heuristics such as Greedy and Cycle. This makes them infeasible for large-scale automatons. In this paper, we show how one can improve the time performance of SYNCHROP and its variants by avoiding unnecessary computations which makes these heuristics more competitive than they already are. Our experimental results show that for 2500 states, SYNCHROP can be made 70-160x faster, via the proposed optimizations. In particular, for 2500 states and 32 letters, the SYNCHROP execution reduces to 66 s from 4745 s. Furthermore, the suggested optimizations become more effective as the number of states in the automata increase.