Using Synchronizing Heuristics to Construct Homing Sequences.

Computing a shortest synchronizing sequence of an automaton is an NP-Hard problem. There are well-known heuristics to find short synchronizing sequences. Finding a shortest homing sequence is also an NP-Hard problem. Unlike existing heuristics to find synchronizing sequences, homing heuristics are not widely studied. In this paper, we discover a relation between synchronizing and homing sequences by creating an automaton called homing automaton. By applying synchronizing heuristics on this automaton we get short homing sequences. Furthermore, we adapt some of the synchronizing heuristics to construct homing sequences.

[1]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[2]  A. N. Trahtman.  SOME RESULTS OF IMPLEMENTED ALGORITHMS OF SYNCHRONIZATION , 2012 .

[3]  Nina Yevtushenko,et al.  Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata , 2015, CIAA.

[4]  A. Roman,et al.  Effective synchronizing algorithms , 2012, Expert Syst. Appl..

[5]  David Eppstein,et al.  Reset Sequences for Monotonic Automata , 1990, SIAM J. Comput..

[6]  Seymour Ginsburg,et al.  On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine , 1958, JACM.

[7]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[8]  Canan Güniçen,et al.  The relation between preset distinguishing sequences and synchronizing sequences , 2014, Formal Aspects of Computing.

[9]  T. Kanade.  Model-Based Testing of Reactive Systems , 2005 .

[10]  Adam Roman.  New Algorithms for Finding Short Reset Sequences in Synchronizing Automata , 2005, IEC.

[11]  Adam Roman,et al.  Forward and backward synchronizing algorithms , 2015, Expert Syst. Appl..

[12]  Hüsnü Yenigün,et al.  Using Structure of Automata for Faster Synchronizing Heuristics , 2018, MODELSWARD.

[13]  J. Taylor,et al.  Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.

[14]  Adam Roman,et al.  Synchronizing finite automata with short reset words , 2009, Appl. Math. Comput..