{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T03:44:20Z","timestamp":1760586260083},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0020-0190(91)90166-f","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"131-136","source":"Crossref","is-referenced-by-count":45,"title":["The synchronization problem in protocol testing and its complexity"],"prefix":"10.1016","volume":"40","author":[{"given":"Sylvia","family":"Boyd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan","family":"Ural","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90166-F_BIB1","first-page":"75","article-title":"An optimization technique for protocol conformance test sequence generation based on UIO sequences and rural Chinese postman tours","volume":"VIII","author":"Aho","year":"1988"},{"key":"10.1016\/0020-0190(91)90166-F_BIB2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the Chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0020-0190(91)90166-F_BIB3","series-title":"Introduction to the Theory of Finite-State Machines","author":"Gill","year":"1962"},{"key":"10.1016\/0020-0190(91)90166-F_BIB4","year":"1987","journal-title":"OSI conformance testing methodology and framework - Part 1-5"},{"key":"10.1016\/0020-0190(91)90166-F_BIB5","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(91)90166-F_BIB6","first-page":"273","article-title":"Graphic programming using odd or even points","volume":"1","author":"Kuan","year":"1962","journal-title":"Chinese Math"},{"key":"10.1016\/0020-0190(91)90166-F_BIB7","series-title":"Proc. 11th IEEE Fault Tolerant Compt. Symp.","first-page":"238","article-title":"Fault detection for sequential machines by transition tours","author":"Naito","year":"1981"},{"key":"10.1016\/0020-0190(91)90166-F_BIB8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0169-7552(87)90087-0","article-title":"OSI conformance testing","volume":"14","author":"Rayner","year":"1987","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/0020-0190(91)90166-F_BIB9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TCOM.1984.1096074","article-title":"Synchronization and specification issues in protocol testing","volume":"32","author":"Sarikaya","year":"1984","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0020-0190(91)90166-F_BIB10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0169-7552(88)90064-5","article-title":"A protocol test generation procedure","volume":"15","author":"Sabnani","year":"1988","journal-title":"Computer Networks and ISDN Systems"},{"issue":"4","key":"10.1016\/0020-0190(91)90166-F_BIB11","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/32.16602","article-title":"Formal methods for protocol testing: A detailed study","volume":"15","author":"Sidhu","year":"1989","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/0020-0190(91)90166-F_BIB12","first-page":"131","article-title":"Protocol conformance testing using multiple UIO sequences","volume":"IX","author":"Shen","year":"1989"},{"issue":"2","key":"10.1016\/0020-0190(91)90166-F_BIB13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"J. SIAM Comput."},{"key":"10.1016\/0020-0190(91)90166-F_BIB14","first-page":"68","article-title":"Optimal test sequence generation for protocols: the Chinese postman algorithm applied to Q.931","author":"Uyar","year":"1986","journal-title":"Proc. IEEE Global Telecommunications Conf."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190166F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190166F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:03Z","timestamp":1555132863000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190166F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["002001909190166F"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90166-f","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}