{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:57:47Z","timestamp":1720627067984},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2004,8,1]],"date-time":"2004-08-01T00:00:00Z","timestamp":1091318400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3284,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2004,8]]},"DOI":"10.1016\/j.entcs.2003.10.004","type":"journal-article","created":{"date-parts":[[2004,7,28]],"date-time":"2004-07-28T14:40:33Z","timestamp":1091025633000},"page":"21-33","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A Symbolic Procedure for Control Reachability in the Asynchronous \u03c0-calculus"],"prefix":"10.1016","volume":"98","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2003.10.004_BIB001","series-title":"TACAS'98","first-page":"298","article-title":"Verifying Networks of Timed Processes","author":"Abdulla","year":"1998"},{"key":"10.1016\/j.entcs.2003.10.004_BIB002","series-title":"CONCUR'01","first-page":"1","article-title":"Channel Representations in Protocol Verification","author":"Abdulla","year":"2001"},{"key":"10.1016\/j.entcs.2003.10.004_BIB003","series-title":"LICS '00","first-page":"132","article-title":"Better is Better than Well: On Efficient Verification of Infinite-State Systems","author":"Abdulla","year":"2000"},{"key":"10.1016\/j.entcs.2003.10.004_BIB004","unstructured":"R. Amadio and C. Meyssonier. On the Decidability of the Control Reachability Problem in the Asynchronous \u03c0-calculus. To appear in Nordic Journal of Computing"},{"key":"10.1016\/j.entcs.2003.10.004_BIB005","series-title":"TACAS '01","first-page":"158","article-title":"Parameterized Verification of Multithreaded Software Libraries","author":"Ball","year":"2001"},{"key":"10.1016\/j.entcs.2003.10.004_BIB006","unstructured":"G. Boudol. Asynchrony and the \u03c0-calculus. Rapport de recherche 1702, INRIA. Sophia-Antipolis, 1992"},{"key":"10.1016\/j.entcs.2003.10.004_BIB007","series-title":"CAV'00","first-page":"403","article-title":"Regular Model Checking","author":"Bouajjani","year":"2000"},{"key":"10.1016\/j.entcs.2003.10.004_BIB008","series-title":"Proc. CSFW'99","first-page":"55","article-title":"A Meta-notation for Protocol Analysis","author":"Cervesato","year":"1999"},{"key":"10.1016\/j.entcs.2003.10.004_BIB009","series-title":"POPL'02","first-page":"45","article-title":"Types as models: model checking message-passing programs","author":"Chaki","year":"2002"},{"issue":"4","key":"10.1016\/j.entcs.2003.10.004_BIB010","article-title":"An Assertional Language for Systems Parametric in Several Dimensions","volume":"50","author":"Delzanno","year":"2001","journal-title":"ENTCS"},{"key":"10.1016\/j.entcs.2003.10.004_BIB011","author":"Delzanno"},{"key":"10.1016\/j.entcs.2003.10.004_BIB012","series-title":"LICS '99","first-page":"352","article-title":"On the Verification of Broadcast Protocols","author":"Esparza","year":"1999"},{"issue":"3","key":"10.1016\/j.entcs.2003.10.004_BIB013","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/146637.146681","article-title":"Reasoning about Systems with Many Processes","volume":"39","author":"German","year":"1992","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.entcs.2003.10.004_BIB014","series-title":"FOSAD'00","first-page":"262","article-title":"Notes on Nominal Calculi for Security and Mobility","author":"Gordon","year":"2000"},{"key":"10.1016\/j.entcs.2003.10.004_BIB015","first-page":"133","article-title":"An Object Calculus for Asynchronous Communication","author":"Honda","year":"1991","journal-title":"ECOOP"},{"key":"10.1016\/j.entcs.2003.10.004_BIB016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A Calculus of Mobile Processes","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/j.entcs.2003.10.004_BIB017","series-title":"CONCUR '95","first-page":"42","article-title":"Checking bisimilarity for finitary \u03c0-calculus","author":"Montanari","year":"1995"},{"key":"10.1016\/j.entcs.2003.10.004_BIB018","series-title":"VMCAI '03","first-page":"116","article-title":"A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution","author":"Yang","year":"2003"},{"key":"10.1016\/j.entcs.2003.10.004_BIB019","series-title":"CAV '94","first-page":"428","article-title":"The Mobility Workbench: A Tool for the Pi-Calculus","author":"Victor","year":"1994"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104050534?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104050534?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T22:33:49Z","timestamp":1636065229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104050534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":19,"alternative-id":["S1571066104050534"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2003.10.004","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,8]]}}}