{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T10:40:01Z","timestamp":1748688001697,"version":"3.41.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319259444"},{"type":"electronic","value":"9783319259451"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25945-1_2","type":"book-chapter","created":{"date-parts":[[2015,11,7]],"date-time":"2015-11-07T03:20:37Z","timestamp":1446866437000},"page":"19-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Using Multiple Adaptive Distinguishing Sequences for Checking Sequence Generation"],"prefix":"10.1007","author":[{"given":"Canan","family":"G\u00fcni\u00e7en","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy-Vincent","family":"Jourdan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00fcsn\u00fc","family":"Yenig\u00fcn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,8]]},"reference":[{"key":"2_CR1","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers, Principles, Techniques, and Tools. Addison-Wesley series in computer science. Addison-Wesley Pub. Co., Reading (1986)"},{"key":"2_CR2","volume-title":"Testing Object-Oriented Systems: Models, Patterns, and Tools","author":"RV Binder","year":"1999","unstructured":"Binder, R.V.: Testing Object-Oriented Systems: Models, Patterns, and Tools. Addison-Wesley, Reading (1999)"},{"key":"2_CR3","unstructured":"Brinksma, E.: A theory for the derivation of tests. In: Proceedings of Protocol Specification, Testing, and Verification VIII, Atlantic City, North-Holland, pp. 63\u201374 (1988)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11430230_11","volume-title":"Testing of Communicating Systems","author":"J Chen","year":"2005","unstructured":"Chen, J., Hierons, R.M., Ural, H., Yenigun, H.: Eliminating redundant tests in a checking sequence. In: Khendek, F., Dssouli, R. (eds.) TestCom 2005. LNCS, vol. 3502, pp. 146\u2013158. Springer, Heidelberg (2005)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"TS Chow","year":"1978","unstructured":"Chow, T.S.: Testing software design modelled by finite state machines. IEEE Trans. Softw. Eng. 4, 178\u2013187 (1978)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"8","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/5.58319","volume":"78","author":"AT Dahbura","year":"1990","unstructured":"Dahbura, A.T., Sabnani, K.K., Uyar, M.\u00dc.: Formal methods for generating protocol conformance test sequences. Proc. IEEE 78(8), 1317\u20131326 (1990)","journal-title":"Proc. IEEE"},{"key":"2_CR7","unstructured":"Dincturk, E.: A Two phase approach for checking sequence generation. Master\u2019s thesis, Sabanci University, Turkey (2009)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11562436_16","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"R Dorofeeva","year":"2005","unstructured":"Dorofeeva, R., El-Fakih, K., Yevtushenko, N.: An improved conformance testing method. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 204\u2013218. Springer, Heidelberg (2005)"},{"key":"2_CR9","series-title":"Computer Applications in Electrical Engineering Series","volume-title":"Fault Detection in Digital Circuits","author":"AD Friedman","year":"1971","unstructured":"Friedman, A.D., Menon, P.R.: Fault Detection in Digital Circuits. Computer Applications in Electrical Engineering Series. Prentice-Hall, Prentice (1971)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/T-C.1970.222975","volume":"19","author":"G Gonenc","year":"1970","unstructured":"Gonenc, G.: A method for the design of fault detection experiments. IEEE Trans. Comput. 19, 551\u2013558 (1970)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/stvr.427","volume":"21","author":"W Grieskamp","year":"2011","unstructured":"Grieskamp, W., Kicillof, N., Stobie, K., Braberman, V.A.: Model-based quality assurance of protocol documentation: tools and methodology. Softw. Test. Verification Reliab. 21(1), 55\u201371 (2011)","journal-title":"Softw. Test. Verification Reliab."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"G\u00fcni\u00e7en, C.: Checking sequence construction using multiple adaptive distinguishing sequences. Master\u2019s thesis, Sabanci University, Turkey (2015)","DOI":"10.1007\/978-3-319-25945-1_2"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-30232-2_8","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004","author":"M Haydar","year":"2004","unstructured":"Haydar, M., Petrenko, A., Sahraoui, H.A.: Formal verification of web applications modeled by communicating automata. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) FORTE 2004. LNCS, vol. 3235, pp. 115\u2013132. Springer, Heidelberg (2004)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Hierons, R.M., Jourdan, G.V., Ural, H., Yenig\u00fcn, H.: Using adaptive distinguishing sequences in checking sequence constructions. In: Proceedings of the 2008 ACM symposium on Applied computing, pp. 682\u2013687. ACM (2008)","DOI":"10.1145\/1363686.1363850"},{"issue":"9","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1109\/TC.2002.1032630","volume":"51","author":"RM Hierons","year":"2002","unstructured":"Hierons, R.M., Ural, H.: Reduced length checking sequences. IEEE Trans. Comput. 51(9), 1111\u20131117 (2002)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1109\/TC.2006.80","volume":"55","author":"RM Hierons","year":"2006","unstructured":"Hierons, R.M., Ural, H.: Optimizing the length of checking sequences. IEEE Trans. Comput. 55, 618\u2013629 (2006)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00446-008-0062-4","volume":"21","author":"RM Hierons","year":"2008","unstructured":"Hierons, R.M., Ural, H.: Checking sequences for distributed test architectures. Distrib. Comput. 21(3), 223\u2013238 (2008)","journal-title":"Distrib. Comput."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An $$n \\log n$$ n log n algorithm for minimizing states in a finite automaton. Technical report STAN-CS-71-190, Stanford University (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/26.494307","volume":"44","author":"D Lee","year":"1996","unstructured":"Lee, D., Sabnani, K.K., Kristol, D.M., Paul, S.: Conformance testing of protocols specified as communicating finite state machines-a guided random walk based approach. IEEE Trans. Commun. 44(5), 631\u2013640 (1996)","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/12.272431","volume":"43","author":"D Lee","year":"1994","unstructured":"Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. IEEE Trans. Comput. 43(3), 306\u2013320 (1994)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-20832-4_21","volume-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","author":"P Cabalar","year":"2011","unstructured":"Cabalar, P.: Answer set; programming? In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol. 6565, pp. 334\u2013343. Springer, Heidelberg (2011)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Low, S.H.: Probabilistic conformance testing of protocols with unobservable transitions. In: Proceedings 1993 International Conference on Network Protocols, pp. 368\u2013375 (1993)","DOI":"10.1109\/ICNP.1993.340890"},{"key":"2_CR23","volume-title":"Automata Studies","author":"EP Moore","year":"1956","unstructured":"Moore, E.P.: Gedanken-experiments. In: Shannon, C., McCarthy, J. (eds.) Automata Studies. Princeton University Press, Princeton (1956)"},{"issue":"4","key":"2_CR24","first-page":"285","volume":"15","author":"K Sabnani","year":"1988","unstructured":"Sabnani, K., Dahbura, A.: A protocol test generation procedure. Comput. Netw. 15(4), 285\u2013297 (1988)","journal-title":"Comput. Netw."},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1109\/32.16602","volume":"15","author":"DP Sidhu","year":"1989","unstructured":"Sidhu, D.P., Leung, T.K.: Formal methods for protocol testing: a detailed study. IEEE Trans. Softw. Eng. 15(4), 413\u2013426 (1989)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-68524-1_12","volume-title":"Testing of Software and Communicating Systems","author":"AS Sim\u00e3o","year":"2008","unstructured":"Sim\u00e3o, A.S., Petrenko, A.: Generating checking sequences for partial reduced finite state machines. In: Suzuki, K., Higashino, T., Ulrich, A., Hasegawa, T. (eds.) TestCom\/FATES 2008. LNCS, vol. 5047, pp. 153\u2013168. Springer, Heidelberg (2008)"},{"issue":"3","key":"2_CR27","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s10703-014-0205-0","volume":"44","author":"UC T\u00fcrker","year":"2014","unstructured":"T\u00fcrker, U.C., Yenig\u00fcn, H.: Hardness and inapproximability of minimizing adaptive distinguishing sequences. Formal Methods Syst. Des. 44(3), 264\u2013294 (2014)","journal-title":"Formal Methods Syst. Des."},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/12.559807","volume":"46","author":"H Ural","year":"1997","unstructured":"Ural, H., Wu, X., Zhang, F.: On minimizing the lengths of checking sequences. IEEE Trans. Comput. 46(1), 93\u201399 (1997)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"2_CR29","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/90.234857","volume":"1","author":"H Ural","year":"1993","unstructured":"Ural, H., Zhu, K.: Optimal length test sequence generation using distinguishing sequences. IEEE\/ACM Trans. Netw. 1(3), 358\u2013371 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"5","key":"2_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/stvr.456","volume":"22","author":"M Utting","year":"2012","unstructured":"Utting, M., Pretschner, A., Legeard, B.: A taxonomy of model-based testing approaches. Softw. Test. Verification Reliab. 22(5), 297\u2013312 (2012)","journal-title":"Softw. Test. Verification Reliab."}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25945-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T10:24:04Z","timestamp":1748687044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25945-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319259444","9783319259451"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25945-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"8 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}