{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T06:52:28Z","timestamp":1773298348142,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2017YFC0804307"],"award-info":[{"award-number":["2017YFC0804307"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71690231"],"award-info":[{"award-number":["71690231"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"BNRist"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Serv. Comput."],"published-print":{"date-parts":[[2022,5,1]]},"DOI":"10.1109\/tsc.2020.2984605","type":"journal-article","created":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T20:40:57Z","timestamp":1585860057000},"page":"1295-1308","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Transition Adjacency Relation Computation for Process Model Similarity"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3820-7950","authenticated-orcid":false,"given":"Jisheng","family":"Pei","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0358-3160","authenticated-orcid":false,"given":"Lijie","family":"Wen","sequence":"additional","affiliation":[{"name":"School of Software, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9780-4827","authenticated-orcid":false,"given":"Xiaojun","family":"Ye","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3572-3789","authenticated-orcid":false,"given":"Akhil","family":"Kumar","sequence":"additional","affiliation":[{"name":"Penn State University, State College, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2010.01.001"},{"key":"ref2","first-page":"151","article-title":"The projected TAR and its application to conformance checking","volume-title":"Proc. 5th Int. Workshop Enterprise Modelling Inf. Syst. Architectures","author":"Prescher"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.96"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19589-1_7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.09.006"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2293879"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2009.2037018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.12.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2807400"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2011.11.003"},{"issue":"3","key":"ref11","first-page":"23","article-title":"Similarity search of business process models","volume":"32","author":"Dumas","year":"2009","journal-title":"IEEE Data Eng. Bull."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29253-8_64"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2010.06.001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49851-4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2007.07.001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/s0304-3975(00)00321-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07734-5_12"},{"issue":"3\/4","key":"ref18","first-page":"231","article-title":"Unfolding based algorithms for the reachability problem","volume":"47","author":"Esparza","year":"2001","journal-title":"Fundamenta Informaticae"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48472-3_4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014746130920"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01384314"},{"key":"ref23","article-title":"Proofs for efficient transition adjacency relation computation","author":"Pei","year":"2019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03848-8_19"}],"container-title":["IEEE Transactions on Services Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4629386\/9799728\/09055055.pdf?arnumber=9055055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:17:43Z","timestamp":1704838663000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9055055\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,1]]},"references-count":24,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tsc.2020.2984605","relation":{},"ISSN":["1939-1374","2372-0204"],"issn-type":[{"value":"1939-1374","type":"electronic"},{"value":"2372-0204","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,1]]}}}