{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:26:18Z","timestamp":1725549978244},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540294146"},{"type":"electronic","value":"9783540320852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11569596_93","type":"book-chapter","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T01:17:55Z","timestamp":1132017475000},"page":"915-926","source":"Crossref","is-referenced-by-count":8,"title":["Generalizing Redundancy Elimination in Checking Sequences"],"prefix":"10.1007","author":[{"given":"K. Tuncay","family":"Tekle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan","family":"Ural","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Cihan","family":"Yalcin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Husnu","family":"Yenigun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"93_CR1","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"1996","unstructured":"Tanenbaum, A.S.: Computer Networks, 3rd edn. Prentice Hall International Editions, Englewood Cliffs (1996)","edition":"3"},{"key":"93_CR2","unstructured":"Gill, A.: Introduction to the Theory of Finite\u2013State Machines. McGraw-Hill, New York (1962)"},{"key":"93_CR3","doi-asserted-by":"crossref","unstructured":"Hennie, F.C.: Fault\u2013detecting experiments for sequential circuits. In: Proceedings of Fifth Annual Symposium on Switching Circuit Theory and Logical Design, Princeton, New Jersey, pp. 95\u2013110 (1964)","DOI":"10.1109\/SWCT.1964.8"},{"key":"93_CR4","first-page":"285","volume":"15","author":"K. Sabnani","year":"1988","unstructured":"Sabnani, K., Dahbura, A.: A protocol test generation procedure. Computer Networks\u00a015, 285\u2013297 (1988)","journal-title":"Computer Networks"},{"key":"93_CR5","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)"},{"key":"93_CR6","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. Computers\u00a043, 306\u2013320 (1994)","journal-title":"IEEE Trans. Computers"},{"key":"93_CR7","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 Transactions on Computers\u00a019, 551\u2013558 (1970)","journal-title":"IEEE Transactions on Computers"},{"key":"93_CR8","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 Transactions on Computers\u00a046, 93\u201399 (1997)","journal-title":"IEEE Transactions on Computers"},{"key":"93_CR9","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1109\/TC.2002.1032630","volume":"51","author":"R.M. Hierons","year":"2002","unstructured":"Hierons, R.M., Ural, H.: Reduced length checking sequences. IEEE Transactions on Computers\u00a051, 1111\u20131117 (2002)","journal-title":"IEEE Transactions on Computers"},{"key":"93_CR10","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., Ural, H., Yenigun, H.: Eliminating redundant tests in a checking sequence. In: Khendek, F., Dssouli, R. (eds.) TestCom 2005. LNCS, vol.\u00a03502, pp. 146\u2013158. Springer, Heidelberg (2005)"},{"key":"93_CR11","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1109\/5.533956","volume":"84","author":"D. Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite\u2013state machines \u2013 a survey. Proceedings of the IEEE\u00a084, 1089\u20131123 (1996)","journal-title":"Proceedings of the IEEE"},{"key":"93_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/90.222912","volume":"1","author":"R.E. Miller","year":"1993","unstructured":"Miller, R.E., Paul, S.: On the generation of minimal\u2013length conformance tests for communication protocols. IEEE\/ACM Transactions on Networking\u00a01, 116\u2013129 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"93_CR13","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company, New York (1979)"},{"key":"93_CR14","unstructured":"Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.: Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference. In: Proceedings of Fifth ACM-SIAM Symposium on Discrete Algorithms, pp. 344\u2013354 (1994)"},{"key":"93_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0020-0190(96)00094-4","volume":"59","author":"T. Fujito","year":"1996","unstructured":"Fujito, T.: A note on approximation of the vertex cover and feedback vertex set problems. Information Processing Letters\u00a059, 59\u201363 (1996)","journal-title":"Information Processing Letters"},{"key":"93_CR16","unstructured":"Hierons, R.M., Ural, H.: Optimizing the length of checking sequences. IEEE Transactions on Computers (2004) (submitted)"}],"container-title":["Lecture Notes in Computer Science","Computer and Information Sciences - ISCIS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11569596_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:40:20Z","timestamp":1619491220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11569596_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540294146","9783540320852"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11569596_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}