{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:32:26Z","timestamp":1778301146969,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6053,"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":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80674-7","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"2-13","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"special_numbering":"C","title":["Bisimulation Trees and the Decidability of Weak Bisimulations"],"prefix":"10.1016","volume":"5","author":[{"given":"Yoram","family":"Hirshfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S1571-0661(05)80674-7_BIB1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","article-title":"Decidability of bisimulation equivalence for processes generating context free languages","volume":"40","author":"Baeton","year":"1993","journal-title":"Journal of the ACM"},{"issue":"4","key":"10.1016\/S1571-0661(05)80674-7_BIB2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1990240403391","article-title":"Graphs canoniques des graphas algebriques","volume":"24","author":"Caucal","year":"1990","journal-title":"Informatique Theoretique et applications (RAIRO)"},{"key":"10.1016\/S1571-0661(05)80674-7_BIB3","series-title":"\u201cDecidability and decomposition in process algebras,\u201d Ph.D. thesis, ECS-LFCS-93-278","author":"Christensen","year":"1993"},{"key":"10.1016\/S1571-0661(05)80674-7_BIB4","first-page":"143","article-title":"Bisimulation equivalence is decidable for basic parallel processes, Proceedings of CONCUR93","volume":"715","author":"Christensen","year":"1993"},{"key":"10.1016\/S1571-0661(05)80674-7_BIB5","first-page":"138","article-title":"Bisimulation equivalence is decidable for all context free processes, Proceedings of CONCUR92","volume":"630","author":"Christensen","year":"1992"},{"key":"10.1016\/S1571-0661(05)80674-7_BIB6","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","article-title":"Finiteness of the odd perfect and primitive abundant numbers with distinct factors","volume":"35","author":"Dixon","year":"1913","journal-title":"American Journal of Mathematics"},{"key":"10.1016\/S1571-0661(05)80674-7_BIB7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","article-title":"A polynomial time algorithm for deciding bisimilarity of normed context free processes","volume":"158","author":"Hirshfeld","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80674-7_BIB8","series-title":"Silence is golden: Branching bisimulation is decidable for context free processes, ECS-LFCS-91-173","author":"H\u00fcttel","year":"1991"},{"key":"10.1016\/S1571-0661(05)80674-7_BIB9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(84)90029-X","article-title":"Petri nets and large sets","volume":"32","author":"McAloon","year":"1984","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80674-7_BIB10","series-title":"\u201cCommunication and concurrency\u201d","author":"Milner","year":"1989"},{"key":"10.1016\/S1571-0661(05)80674-7_BIB11","first-page":"217","article-title":"Decidability of bisimulation equivalence for normed pushdown processes, Proceedings of CONCUR96","volume":"1119","author":"Stirling","year":"1996"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806747?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806747?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:08:50Z","timestamp":1761610130000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105806747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":11,"alternative-id":["S1571066105806747"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80674-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bisimulation Trees and the Decidability of Weak Bisimulations","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(05)80674-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}