{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:15:13Z","timestamp":1725754513899},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642417061"},{"type":"electronic","value":"9783642417078"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41707-8_3","type":"book-chapter","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T06:56:38Z","timestamp":1383116198000},"page":"33-48","source":"Crossref","is-referenced-by-count":15,"title":["Adaptive Homing and Distinguishing Experiments for Nondeterministic Finite State Machines"],"prefix":"10.1007","author":[{"given":"Natalia","family":"Kushik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"El-Fakih","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Yevtushenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Bochmann, G.V., Petrenko, A.: Protocol testing: review of methods and relevance for software testing. In: Proc. of International Symposium on Software Testing and Analysis, Seattle, pp. 109\u2013123 (1994)","DOI":"10.1145\/186258.187153"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1016\/j.infsof.2010.07.001","volume":"52","author":"R. Dorofeeva","year":"2010","unstructured":"Dorofeeva, R., El-Fakih, K., Maag, S., Cavalli, A.R., Yevtushenko, N.: FSM-based conformance testing methods: a survey annotated with experimental evaluation. Information and Software Technology\u00a052, 1286\u20131297 (2010)","journal-title":"Information and Software Technology"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Gill, A.: State-identification experiments in finite automata. Information and Control, 132\u2013154 (1961)","DOI":"10.1016\/S0019-9958(61)80003-X"},{"key":"3_CR4","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1978","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory. McGraw-Hill, New York (1978)"},{"issue":"3","key":"3_CR5","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. on Computers\u00a043(3), 306\u2013320 (1994)","journal-title":"IEEE Trans. on Computers"},{"issue":"8","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D. Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines-a survey. Proceedings of the IEEE\u00a084(8), 1090\u20131123 (1996)","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1049\/iet-sen.2008.0018","volume":"3","author":"A. Simao","year":"2009","unstructured":"Simao, A., Petrenko, A., Maldonado, J.C.: Comparing finite state machine test. IET Software\u00a03(2), 91\u2013105 (2009)","journal-title":"IET Software"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. In: Automata Studies (Annals of Mathematical Studies no.1), pp. 129\u2013153. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-006"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Hennie, F.C.: Fault detecting experiments for sequential circuits. In: Proc. of 5th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 95\u2013110. Princeton (1964)","DOI":"10.1109\/SWCT.1964.8"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Petrenko, A., Simao, A., Yevtushenko, N.: Generating Checking Sequences for Nondeterministic Finite State Machines. In: Proc. of ICST 2012, pp. 310\u2013319 (2012)","DOI":"10.1109\/ICST.2012.111"},{"key":"3_CR11","unstructured":"Mathur, A.: Foundations of Software Testing. Addison Wesley (2008)"},{"key":"3_CR12","unstructured":"Agibalov, G., Oranov, A.: Lectures on Automata Theory. Tomsk State University Publishers (1984) (in Russian)"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1145\/320932.320938","volume":"5","author":"S. Ginsburg","year":"1958","unstructured":"Ginsburg, S.: On the length of the smallest uniform experiment which distinguishes the terminal states of a machine. Journal of the ACM\u00a05(3), 266\u2013280 (1958)","journal-title":"Journal of the ACM"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/321088.321098","volume":"8","author":"T.N. Hibbard","year":"1961","unstructured":"Hibbard, T.N.: Lest upper bounds on minimal terminal state experiments of two classes of sequential machines. Journal of the ACM\u00a08(4), 601\u2013612 (1961)","journal-title":"Journal of the ACM"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/11498490_2","volume-title":"Model-Based Testing of Reactive Systems","author":"S. Sandberg","year":"2005","unstructured":"Sandberg, S.: Homing and Synchronization Sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472, pp. 5\u201333. Springer, Heidelberg (2005)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-64359-1_709","volume-title":"Parallel and Distributed Processing","author":"B. Ravikumar","year":"1998","unstructured":"Ravikumar, B.: Parallel algorithms for finite automata problems. In: Rolim, J.D.P. (ed.) IPPS-WS 1998 and SPDP-WS 1998. LNCS, vol.\u00a01388, p. 373. Springer, Heidelberg (1998)"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/stvr.374","volume":"17","author":"N. Spitsyna","year":"2007","unstructured":"Spitsyna, N., El-Fakih, K., Yevtushenko, N.: Studying the separability relation between finite state machines. Software Testing, Verification and Reliability\u00a017(4), 227\u2013241 (2007)","journal-title":"Software Testing, Verification and Reliability"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-22256-6_20","volume-title":"Implementation and Application of Automata","author":"N. Kushik","year":"2011","unstructured":"Kushik, N., El-Fakih, K., Yevtushenko, N.: Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol.\u00a06807, pp. 215\u2013224. Springer, Heidelberg (2011)"},{"key":"3_CR19","unstructured":"Starke, P.: Abstract Automata. American Elsevier (1972)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-642-39274-0_20","volume-title":"CIAA 2013","author":"N. Kushik","year":"2013","unstructured":"Kushik, N., Yevtushenko, N.: On the Length of Homing Sequences for Nondeterministic Finite State Machines. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol.\u00a07982, pp. 220\u2013231. Springer, Heidelberg (2013)"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSE.2003.1166585","volume":"19","author":"F. Zhang","year":"2003","unstructured":"Zhang, F., Cheung, T.: Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines. IEEE Transactions on Software Engineering\u00a019(1), 1\u201314 (2003)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., Yannakakis, M.: Distinguishing tests for nondeterministic and probabilistic machines. In: Proc. of the 27th ACM Symposium on Theory of Computing, pp. 363\u2013372 (1995)","DOI":"10.1145\/225058.225161"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/11759744_9","volume-title":"Formal Approaches to Software Testing","author":"A. Petrenko","year":"2006","unstructured":"Petrenko, A., Yevtushenko, N.: Conformance Tests as Checking Experiments for Partial Nondeterministic FSM. In: Grieskamp, W., Weise, C. (eds.) FATES 2005. LNCS, vol.\u00a03997, pp. 118\u2013133. Springer, Heidelberg (2006)"},{"issue":"6","key":"3_CR24","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1134\/S0361768808060030","volume":"34","author":"M.L. Gromov","year":"2008","unstructured":"Gromov, M.L., Evtushenko, N.V., Kolomeets, A.V.: On the Synthesis of Adaptive Tests for Nondeterministic Finite State Machines. Progr. and Comp. Software\u00a034(6), 322\u2013329 (2008)","journal-title":"Progr. and Comp. Software"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-24580-0_12","volume-title":"Testing Software and Systems","author":"A. Petrenko","year":"2011","unstructured":"Petrenko, A., Yevtushenko, N.: Adaptive Testing of Deterministic Implementations Specified by Nondeterministic FSMs. In: Wolff, B., Za\u00efdi, F. (eds.) ICTSS 2011. LNCS, vol.\u00a07019, pp. 162\u2013178. Springer, Heidelberg (2011)"},{"key":"3_CR26","unstructured":"Tretmans, J.: Model-Based Testing with Labelled Transition Systems: There is nothing More Practical than a Good Theory. Slides from the lecture at TAROT Summer School (2010), \n                    \n                      http:\/\/tarot2010.ist.tugraz.at\/"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Gromov, M., El-Fakih, K., Shabaldina, N., Yevtushenko, N.: Distinguing non-deterministic timed finite state machines. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) FMOODS\/FORTE 2009. LNCS, vol.\u00a05522, pp. 137\u2013151. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02138-1_9"},{"key":"3_CR28","unstructured":"El-Fakih, K., Gromov, M., Shabaldina, N., Yevtushenko, N.: Distinguishing experiments for timed nondeterministic finite state machines. Acta Cybernetica (to appear)"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Petrenko, A., Yevtushenko, N., Bochmann, G.V.: Testing Deterministic Implementations from their Nondeterministic Specifications. In: Proc. of the IFIP Ninth International Workshop on Testing of Communicating Systems, pp. 125\u2013140 (1996)","DOI":"10.1007\/978-0-387-35062-2_10"}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41707-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T22:10:19Z","timestamp":1558649419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41707-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642417061","9783642417078"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41707-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}