{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:31Z","timestamp":1761611071517},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0304-3975(98)00177-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:38:29Z","timestamp":1027636709000},"page":"313-345","source":"Crossref","is-referenced-by-count":2,"title":["A complexity analysis of bisimilarity for value-passing processes"],"prefix":"10.1016","volume":"238","author":[{"given":"Michele","family":"Boreale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00177-7_BIB1","series-title":"Introduction to the Theory of Complexity","author":"Bovet","year":"1993"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB2","doi-asserted-by":"crossref","unstructured":"M. Boreale, R. De Nicola, A symbolic semantics for the \u03c0-calculus \u2013 extended abstract, in: B. Jonsson, J. Parrow (Eds.), Proc. Concur \u201994, Lecture Notes in Computer Science, Vol. 836, Springer, Berlin, 1994, pp. 299\u2013314; Full version: Inform. and Comput. 126 (1996) 34\u201352.","DOI":"10.1007\/978-3-540-48654-1_24"},{"issue":"1","key":"10.1016\/S0304-3975(98)00177-7_BIB3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB4","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem proving procedures, Proc. 3rd ACM Symp. on Theory of Computing, 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. AMS"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB6","doi-asserted-by":"crossref","unstructured":"M. Hennessy, H. Lin, Proof systems for message-passing process algebras, in: E. Best (Ed.), Proc. of CONCUR \u201993, Lecture Notes in Computer Science, Vol. 715, Springer-Verlag, Berlin, 1993.","DOI":"10.1007\/3-540-57208-2_15"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","article-title":"Symbolic bisimulations","volume":"138","author":"Hennessy","year":"1995","journal-title":"Theoret. Compu. Sci."},{"key":"10.1016\/S0304-3975(98)00177-7_BIB8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/inco.1993.1069","article-title":"Deciding bisimulation equivalences for a class of non-finite state programs","volume":"107","author":"Jonsson","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(98)00177-7_BIB9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS expressions, finite state processes, and three problems of equivalence","volume":"86","author":"Kanellakis","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(98)00177-7_BIB10","doi-asserted-by":"crossref","unstructured":"R. Milner, A calculus of communicating systems, Lecture Notes in Computer Science, Vol. 92, Springer, Berlin, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB11","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB12","doi-asserted-by":"crossref","unstructured":"R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Part I and II. Inform. and Comput. 100 (1992) 1\u201341 and 42\u201378.","DOI":"10.1016\/0890-5401(92)90008-4"},{"issue":"6","key":"10.1016\/S0304-3975(98)00177-7_BIB13","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00177-7_BIB14","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB15","doi-asserted-by":"crossref","unstructured":"J. Parrow, D. Sangiorgi, Algebraic theories for name-passing calculi, Inform. and Comput. 120 (2) (1995).","DOI":"10.1006\/inco.1995.1108"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB16","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi, A theory of bisimulation for the \u03c0-calculus, in: E. Best (Ed.), Proc CONCUR \u201993, Lecture Notes in Computer Science, Vol. 715, Springer, Berlin, 1993; Acta Inform. 33 (1996).","DOI":"10.1007\/s002360050036"},{"key":"10.1016\/S0304-3975(98)00177-7_BIB17","doi-asserted-by":"crossref","unstructured":"L. Stockmeyer, A. Meyer, Word problems requiring exponential time, Proc. 5th ACM Symp. on Theory of Computing, 1973, pp. 1\u20139.","DOI":"10.1145\/800125.804029"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001777?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001777?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T23:09:05Z","timestamp":1580857745000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397598001777"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00177-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}