{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T13:04:36Z","timestamp":1749128676061,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["MOST 105-2923-E-002-016-MY3","RSF 16-49-03012"],"award-info":[{"award-number":["MOST 105-2923-E-002-016-MY3","RSF 16-49-03012"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["19-07-00327\/19"],"award-info":[{"award-number":["19-07-00327\/19"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1109\/tc.2021.3058302","type":"journal-article","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T10:13:03Z","timestamp":1612951983000},"page":"696-711","source":"Crossref","is-referenced-by-count":2,"title":["Homing Sequence Derivation With Quantified Boolean Satisfiability"],"prefix":"10.1109","volume":"71","author":[{"given":"Kuan-Hua","family":"Tu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-En","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2279-4732","authenticated-orcid":false,"given":"Jie-Hong R.","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8691-6655","authenticated-orcid":false,"given":"Natalia","family":"Kushik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4006-1161","authenticated-orcid":false,"given":"Nina","family":"Yevtushenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/186258.187153"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SWCT.1964.8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/12.272431"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11498490_2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27812-2_12"},{"key":"ref6","first-page":"315","article-title":"Improving protocol passive testing through \u201cGedanken","volume-title":"Proc. Int. Conf. Softw. Qual. Rel. Secur.","author":"Kushik"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39274-0_20"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1134\/S0361768814060140"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9516-6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.07.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2851613.2851835"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511816239"},{"article-title":"Efficient algorithms for constructing preset distinguishing sequences for nondeterministic finite state machines","year":"2016","author":"Haddad","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190077"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_10"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24318-4_25"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67549-7_14"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31280-0_6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-012-0152-6"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41707-8_3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22256-6_20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-014-0357-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.180.5"},{"article-title":"FRAIGs: A unifying representation for logic synthesis and verification","year":"2005","author":"Mishchenko","key":"ref24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-5327-8_25"},{"volume-title":"Propositional Logic: Deduction and Algorithms","year":"1999","author":"Buning","key":"ref26"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2015.7542263"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.277.7"},{"article-title":"FSMHSGen","year":"2019","author":"Lopez","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/EWDTS.2015.7493141"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"article-title":"QDIMACS standard version 1.1","year":"2005","author":"Narizzano","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22438-6_10"},{"year":"2014","key":"ref34","article-title":"QCIR-G14: A non-prenex non-CNF format for quantified Boolean formulas"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/12.280804"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1515\/9781400882618-006"},{"volume-title":"Introduction to the Theory of Finite-State Machines","year":"1962","author":"Gill","key":"ref37"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/5.533956"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.5"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/0219033"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.5220\/0005854500830090"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33394-2_9"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-02508-3_19"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-018-9429-3"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD45719.2019.8942078"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/9709504\/09351630.pdf?arnumber=9351630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:20:04Z","timestamp":1704842404000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9351630\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":45,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tc.2021.3058302","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[2022,3,1]]}}}