Friedman, A.D., Menon, P.R.: Fault Detection in Digital Circuits. Computer Applications in Electrical Engineering Series. Prentice-Hall (1971)
Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley (1986)
Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Softw. Eng. SE-4(3), 178–187 (1978)
Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice Hall (1991)
Lee, D., Yannakakis, M.: Principles and methods of testing finite-state machines—a survey. Proc. IEEE 84(8), 1089–1123 (1996)
Sabnani, K., Dahbura, A.: A protocol test generation procedure. Comput. Netw. 15(4), 285–297 (1988)
Binder, R.V.: Testing Object-Oriented Systems: Models, Patterns, and Tools. Addison-Wesley (1999)
Haydar, M., Petrenko, A., Sahraoui, H.: Formal verification of web applications modeled by communicating automata. In: Formal Techniques for Networked and Distributed Systems—FORTE 2004, vol. 3235, pp. 115–132. Springer (2004)
Lee, D., Yannakakis, M.: Testing finite-state machines: State identification and verification. IEEE Trans. Comput. 43(3), 306–320 (1994)
Ural, Hasan: Formal methods for test sequence generation. Comput. Commun. 15(5), 311–325 (1992)
Tsai, P.-C., Wang, S.-J., Chang, F.-M.: FSM-based programmable memory BIST with macro command. In: Memory Technology, Design, and Testing, 2005. MTDT 2005. IEEE International Workshop on, pp. 72–77 (2005)
Zarrineh, K., Upadhyaya, S.J.: Programmable memory BIST and a new synthesis framework. In: Fault-Tolerant Computing, 1999. Digest of Papers. Twenty-Ninth Annual International Symposium on, pp. 352–355 (1999)
Yannakakis, M., Lee, D.: Testing finite state machines: Fault detection. J. Comput. Syst. Sci. 50(2), 209–227 (1995)
Yevtushenko, N., Petrenko, A.: Synthesis of test experiments in some classes of automata. Autom. Control Comput. Sci. 4 (1990)
Petrenko, Alexandre, Yevtushenko, Nina: Testing from partial deterministic FSM specifications. IEEE Trans. Comput. 54(9), 1154–1165 (2005)
Rho, J.-K., Hachtel, G., Somenzi, F.: Don’t care sequences and the optimization of interacting finite state machines. In: Computer-Aided Design, 1991. ICCAD-91. Digest of Technical Papers. IEEE International Conference on, pp. 418–421 (1991)
da Silva Simão, A., Petrenko, A.: Generating checking sequences for partial reduced finite state machines. Test. Softw. Commun. Syst. 153–168 (2008)
Hierons, R.M., Türker, U.C.: Distinguishing sequences for partially specified FSMs. In: NASA Formal Methods—6th International Symposium, NFM 2014, Houston, TX, USA, April 29 - May 1, 2014. Proceedings, pp. 62–76 (2014)
Türker, U.C., Yenigün, H.: Hardness and inapproximability of minimizing adaptive distinguishing sequences. Formal Methods Syst. Des. 44(3), 264–294 (2014)
Güniçen, C., Türker, U.C., Ural, H., Yenigün, H.: Generating preset distinguishing sequences using SAT. In: Computer and Information Sciences II—26th International Symposium on Computer and Information Sciences, London, UK, 26–28 September 2011, pp. 487–493 (2011)
Gill, A.: Introduction to The Theory of Finite State Machines. McGraw-Hill, New York (1962)
Brglez, F.: ACM/SIGMOD benchmark dataset. http://cbl.ncsu.edu:16080/benchmarks/Benchmarks-upto-1996.html
Türker, U.C., Ünlüyurt, T., Yenigün, H.: Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences. In: Testing Software and Systems—26th IFIP WG 6.1 International Conference, ICTSS 2014, Madrid, Spain, September 23–25, 2014. Proceedings, pp. 32–47 (2014)
US