{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:41:00Z","timestamp":1774946460605,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3831,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80530-9","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Deciding Framed Bisimilarity"],"prefix":"10.1016","volume":"68","author":[{"given":"Hans","family":"H\u00fcttel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB1","doi-asserted-by":"crossref","unstructured":"M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi-calculus. In Fourth ACM Conference on Computer and Communications Security. ACM Press, 1997.","DOI":"10.1145\/266420.266432"},{"issue":"4","key":"10.1016\/S1571-0661(04)80530-9_NEWBIB2","first-page":"267","article-title":"A bisimulation method for cryptographic protocols","volume":"5","author":"Abadi","year":"1998","journal-title":"Nordic Journal of Computing"},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB3","unstructured":"R.M. Amadio, D. Lugiez. On the reachability problem in cryptographic protocols Proceedings of CONCUR 00, LNCS 1877, Springer-Verlag."},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Boreale, Michele & De Nicola, Rocco & Pugliese, Rosario. Proof Techniques for Cryptographic Processes (Extended version). Proceedings of LICS 99, pp. 157\u2013166, 1999.","DOI":"10.1109\/LICS.1999.782608"},{"issue":"Number 1-2","key":"10.1016\/S1571-0661(04)80530-9_NEWBIB5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0304-3975(98)00177-7","article-title":"A Complexity Analysis of Bisimilarity for Value-passing Processes","volume":"Vol. 238","author":"Boreale","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB6","doi-asserted-by":"crossref","unstructured":"J. Borgstr\u00f6m and U. Nestmann On Bisimulations for the Spi Calculus In Proceedings of AMAST 2002, LNCS 2422, pp. 287\u2013303, September 2002.","DOI":"10.1007\/3-540-45719-4_20"},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0304-3975(96)00325-8","article-title":"On the Decidability of Process Equivalences for the \u03c0-Calculus","volume":"vol. 183","author":"Dam","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB8","unstructured":"A.S. Elkj\u00e6r, H. H\u00fcttel M. H\u00f6hle and K. O. Nielsen. Towards automatic bisimilarity checking in the spi calculus. Proceedings of DMTCS'99 and CATS'99. Australian Computer Science Communications, 21 (3), Springer, 1999."},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB9","doi-asserted-by":"crossref","unstructured":"U. Frendrup and J. Nyholm Jensen. Bisimilarity in the Spi-Calculus, Masters' Thesis, Department of Computer Science, Aalborg University, June 2001.","DOI":"10.7146\/brics.v8i8.20463"},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB10","unstructured":"Hans H\u00fcttel, Josva Kleist, Uwe Nestmann and Bj\u00f6rn Victor. A symbolic semantics for the spi-calculus. Unpublished manuscript."},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Huimin Lin. Complete Proof Systems for Observation Congruences in Finite-Control Pi-calculus. In Kim G. Larsen and Mogens Nielsen (editors), Automata, Languages and Programming, 25th Colloquium. Volume 1443 of Lecture Notes in Computer Science, pages 443\u2013454, Aalborg, Denmark, July 1998, Springer-Verlag.","DOI":"10.1007\/BFb0055074"},{"issue":"1","key":"10.1016\/S1571-0661(04)80530-9_NEWBIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A Calculus of Mobile Processes, Parts I and II","volume":"vol. 100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB13","series-title":"Communicating and mobile systems: the \u03c0-calculus","author":"Milner","year":"1999"},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB14","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB15","unstructured":"Rocco De Nicola and Matthew C. B. Hennessy. Testing equivalence for processes. In Josep D\u00edaz (editor) Automata, Languages and Programming, 10th Colloquium. Volume 154 of Lecture Notes in Computer Science, pages 548\u2013560, Barcelona, Spain, 18\u201322 July 1983. Springer-Verlag."},{"key":"10.1016\/S1571-0661(04)80530-9_NEWBIB16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s002360050036","article-title":"A theory of bisimulation for the \u03c0-calculus","volume":"vol. 33","author":"Sangiorgi","year":"1996","journal-title":"Acta Informatica"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805309?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805309?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:33Z","timestamp":1761609933000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104805309"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80530-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Deciding Framed Bisimilarity","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80530-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}