Effective synchronizing algorithms

The notion of a synchronizing sequence plays an important role in the model-based testing of reactive systems, such as sequential circuits or communication protocols. The main problem in this approach is to find the shortest possible sequence which synchronizes the automaton being a model of the system under test. This can be done with a synchronizing algorithm. In this paper we analyze the synchronizing algorithms described in the literature, both exact (with exponential runtime) and greedy (polynomial). We investigate the implementation of the exact algorithm and show how this implementation can be optimized by use of some efficient data structures. We also propose a new greedy algorithm, which relies on some new heuristics. We compare our algorithms with the existing ones, with respect to both runtime and quality aspect.

[1]  A. N. Trahtman,et al.  An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture , 2006, 0709.1197.

[2]  Balas K. Natarajan.  An algorithmic approach to the automated design of parts orienters , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

[4]  Björn Karlsson,et al.  Beyond the C++ Standard Library: An Introduction to Boost , 2005 .

[5]  Jarkko Kari.  Synchronization and Stability of Finite Automata , 2002, J. Univers. Comput. Sci..

[6]  Seh-Woong Jeong,et al.  Exact calculation of synchronizing sequences based on binary decision diagrams , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[9]  I. K. Rystsov,et al.  In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton , 1987 .

[10]  A. N. Trahtman,et al.  The road coloring problem , 2007, 0709.0099.

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

[12]  Yulan Zhao,et al.  Conformance testing for IS-IS protocol based on E-LOTOS , 2010, 2010 IEEE International Conference on Information Theory and Information Security.

[13]  A. M. Ponce,et al.  Formal specification of conformance testing documents for communication protocols , 1994, 5th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Wireless Networks - Catching the Mobile Future..

[14]  Evgeny Skvortsov,et al.  Experimental Study of the Shortest Reset Word of Random Automata , 2011, CIAA.

[15]  Manfred Broy,et al.  Model-Based Testing of Reactive Systems, Advanced Lectures , 2005 .

[16]  Manfred Broy,et al.  Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science) , 2005 .

[17]  Björn Karlsson,et al.  Beyond the C++ Standard Library , 2005 .

[18]  Manfred Broy,et al.  Model-Based Testing of Reactive Systems, Advanced Lectures [The volume is the outcome of a research seminar that was held in Schloss Dagstuhl in January 2004] , 2005, Model-Based Testing of Reactive Systems.

[19]  Peter M. Higgins,et al.  The range order of a product of i transformations from a finite full transformation semigroup , 1988 .

[20]  Teruo Higashino,et al.  A conformance testing method for communication protocols modeled as concurrent DFSMs. Treatment of non-observable non-determinism , 2001, Proceedings 15th International Conference on Information Networking.

[21]  Mikhail V. Volkov,et al.  Synchronizing monotonic automata , 2004, Theor. Comput. Sci..

[22]  Mikhail V. Volkov,et al.  Synchronizing Automata and the Cerny Conjecture , 2008, LATA.

[23]  Irith Pomeranz,et al.  On synchronizing sequences and test sequence partitioning , 1998, Proceedings. 16th IEEE VLSI Test Symposium (Cat. No.98TB100231).

[24]  Fabio Somenzi,et al.  Multiple observation time single reference test generation using synchronizing sequences , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[25]  Jörg Olschewski,et al.  The Complexity of Finding Reset Words in Finite Automata , 2010, MFCS.

[26]  R.G. Deshmukh,et al.  An algorithm to determine shortest length distinguishing, homing, and synchronizing sequences for sequential machines , 1994, Conference Record Southcon.

[27]  Ján Cerný,et al.  On directable automata , 1971, Kybernetika (Praha).

[28]  J. Pin.  On two Combinatorial Problems Arising from Automata Theory , 1983 .