{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:17:24Z","timestamp":1762460244308},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,17]]},"DOI":"10.1109\/smc52423.2021.9658672","type":"proceedings-article","created":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:34:35Z","timestamp":1641483275000},"page":"2360-2367","source":"Crossref","is-referenced-by-count":0,"title":["New Symbolic Model and Equivalences Checking for Open Automata"],"prefix":"10.1109","author":[{"given":"BiYang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Eric","family":"Madelaine","sequence":"additional","affiliation":[]},{"given":"Min","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535849"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482830-9\/50025-4"},{"key":"ref6","article-title":"Using SMT engine to generate symbolic automata","author":"qin","year":"2018","journal-title":"18th International Workshop on Automated Verification of Critical Systems (AVOCS 2018)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39570-8_12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3372884.3373161"},{"article-title":"Compositional equivalences based on open pnets","year":"2020","author":"ameur-boulifa","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00172-F"},{"key":"ref9","article-title":"Symbolic Weak Equivalences: Extension, Algorithms, and Minimization- Extended version","author":"madelaine","year":"2021","journal-title":"Research report Inria & University Cote d’Azur CNRS I3S Sophia Antipolis France East China Normal University (Shanghai)"},{"article-title":"A Calculus of Communicating Systems","year":"1982","author":"milner","key":"ref1"}],"event":{"name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","start":{"date-parts":[[2021,10,17]]},"location":"Melbourne, Australia","end":{"date-parts":[[2021,10,20]]}},"container-title":["2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9658572\/9658575\/09658672.pdf?arnumber=9658672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T12:56:24Z","timestamp":1652187384000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9658672\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/smc52423.2021.9658672","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}