A. V. Aho, A. T. Dahbura, D. Lee, and M. U. Uyar, An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours, Protocol Specification, Testing, and Verification VIII, pp.75-86, 1988.
DOI : 10.1109/26.111442

R. Alur, P. Cerny, P. Madhusudan, and W. Nam, Synthesis of interface specifications for java classes, Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '05, pp.98-109, 2005.

A. Betin-can and T. Bultan, Verifiable concurrent programming using concurrency controllers, Proceedings. 19th International Conference on Automated Software Engineering, 2004., pp.248-257, 2004.
DOI : 10.1109/ASE.2004.1342742
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5921

T. S. Chow, Testing software design modelled by finite state machines, IEEE Transactions on Software Engineering, vol.4, pp.178-187, 1978.
DOI : 10.1109/tse.1978.231496

I. Pomeranz and S. M. Reddy, Test generation for multiple state-table faults in finite-state machines, IEEE Transactions on Computers, vol.46, issue.7, pp.783-794, 1997.
DOI : 10.1109/12.599899

J. Whaley, M. C. Martin, and M. S. Lam, Automatic extraction of object-oriented component interfaces, ACM SIGSOFT Software Engineering Notes, vol.27, issue.4, pp.218-228, 2002.
DOI : 10.1145/566171.566212

K. Sabnani and A. Dahbura, A protocol test generation procedure, Computer Networks and ISDN Systems, vol.15, issue.4, pp.285-297, 1988.
DOI : 10.1016/0169-7552(88)90064-5

F. C. Hennie, Fault-detecting experiments for sequential circuits, Proceedings of Fifth Annual Symposium on Switching Circuit Theory and Logical Design, pp.95-110, 1964.

G. Gonenc, A Method for the Design of Fault Detection Experiments, IEEE Transactions on Computers, vol.19, issue.6, pp.551-558, 1970.
DOI : 10.1109/T-C.1970.222975

M. P. Vasilevskii, Failure diagnosis of automata, Cybernetics, vol.9, issue.4, pp.653-665, 1007.
DOI : 10.1007/BF01068590

S. T. Vuong, W. W. Chan, and M. R. Ito, The UIOv-method for protocol test sequence generation, The 2nd International Workshop on Protocol Test Systems, 1989.

S. Fujiwara, G. V. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi, Test selection based on finite state models, IEEE Transactions on Software Engineering, vol.17, issue.6, pp.591-603, 1991.
DOI : 10.1109/32.87284
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.8341

H. Ural and K. Zhu, Optimal length test sequence generation using distinguishing sequences, IEEE/ACM Transactions on Networking, vol.1, issue.3, pp.358-371, 1993.
DOI : 10.1109/90.234857

A. Petrenko and N. Yevtushenko, Testing from Partial Deterministic FSM Specifications, IEEE Transactions on Computers, vol.54, issue.9, pp.1154-1165, 2005.
DOI : 10.1109/TC.2005.152

R. M. Hierons, G. V. Jourdan, H. Ural, and H. Yenigun, Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences, 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods, pp.157-166, 2009.
DOI : 10.1109/SEFM.2009.12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.8221

R. M. Hierons and H. Ural, Optimizing the length of checking sequences, IEEE Transactions on Computers, vol.55, issue.5, pp.618-629, 2006.
DOI : 10.1109/TC.2006.80

R. M. Hierons and H. Ural, Reduced length checking sequences, IEEE Transactions on Computers, vol.37, issue.9, pp.1111-1117, 2002.
DOI : 10.1109/TC.2002.1032630
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.591.5863

R. M. Hierons, Using a minimal number of resets when testing from a finite state machine, Information Processing Letters, vol.90, issue.6, pp.287-292, 2004.
DOI : 10.1016/j.ipl.2004.03.003

H. Ural, X. Wu, and F. Zhang, On minimizing the lengths of checking sequences, IEEE Transactions on Computers, vol.46, issue.1, pp.93-99, 1997.
DOI : 10.1109/12.559807

Z. Kohavi, Switching and Finite State Automata Theory, 1978.
DOI : 10.1017/cbo9780511816239

R. T. Boute, Distinguishing Sets for Optimal State Identification in Checking Experiments, IEEE Transactions on Computers, vol.23, issue.8, pp.874-877, 1974.
DOI : 10.1109/T-C.1974.224043

G. V. Jourdan, H. Ural, H. Yenigun, and J. Zhang, Lower bounds on lengths of checking sequences, Formal Aspects of Computing, vol.46, issue.3, pp.667-679, 2010.
DOI : 10.1007/s00165-009-0135-6

D. Lee and M. Yannakakis, Testing finite-state machines: state identification and verification, IEEE Transactions on Computers, vol.43, issue.3, pp.306-320, 1994.
DOI : 10.1109/12.272431

M. N. Sokolovskii, Diagnostic experiments with automata, Cybernetics and Systems Analysis, vol.7, pp.988-994, 1971.

N. Kushik, K. El-fakih, and N. Yevtushenko, Adaptive Homing and Distinguishing Experiments for Nondeterministic Finite State Machines, Testing Software and Systems, pp.33-48, 2013.
DOI : 10.1007/978-3-642-41707-8_3

A. Gill, Introduction to The Theory of Finite State Machines, 1962.

U. C. Türker and H. Yenigun, Hardness and inapproximability of minimizing adaptive distinguishing sequences. Formal Methods in System Design, pp.264-294, 2014.

F. C. Hennie, Finite-state models for logical machines, 1968.

C. Gunicen, U. C. Türker, H. Ural, and H. Yenigün, Generating preset distinguishing sequences using SAT, Computer and Information Sciences II, pp.487-493