{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:57Z","timestamp":1761611157605,"version":"build-2065373602"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5688,"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":[[1998]]},"DOI":"10.1016\/s1571-0661(05)80259-2","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"179-190","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["Hardness results for weak bisimilarity of simple process algebras"],"prefix":"10.1016","volume":"18","author":[{"given":"Jitka","family":"St\u0159\u00edAbrn\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80259-2_BIB1","doi-asserted-by":"crossref","unstructured":"Christensen S., Hirshfeld Y. and Moller F. Bisimulation Equivalence is Decidable for Basic Parallel Processes, in Proceedings of CONCUR 93, LNCS 715, 143\u2013157, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"10.1016\/S1571-0661(05)80259-2_BIB2","doi-asserted-by":"crossref","unstructured":"Christensen S., H\u00fcttel H. and Stirling C. Bisimulation equivalence is decidable for all context-free processes, in Proceedings of CONCUR 92, LNCS 630, 138\u2013147, 1992.","DOI":"10.1007\/BFb0084788"},{"key":"10.1016\/S1571-0661(05)80259-2_BIB3","series-title":"In Fundamentals of Computation Theory 95, LNCS 965","first-page":"221","article-title":"Petri nets, commutative context-free grammars and basic parallel processes","author":"Esparza","year":"1995"},{"key":"10.1016\/S1571-0661(05)80259-2_BIB4","series-title":"Freeman, San Francisco","article-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S1571-0661(05)80259-2_BIB5","unstructured":"Hirshfeld Y. Bisimulation Trees and the Decidability of Weak Bisimulations. Draft of a paper."},{"key":"10.1016\/S1571-0661(05)80259-2_BIB6","series-title":"In LFCS Report Series, University of Edinburgh","article-title":"A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes","author":"Hirshfeld","year":"1994"},{"key":"10.1016\/S1571-0661(05)80259-2_BIB7","series-title":"In Math. Struct in Comp. Science 6","first-page":"251","article-title":"A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes","author":"Hirshfeld","year":"1996"},{"key":"10.1016\/S1571-0661(05)80259-2_BIB8","series-title":"In LFCS Report Series, University of Edinburgh","article-title":"A polynomial algorithm for deciding bisimilarity of normed context-free processes","author":"Hirshfeld","year":"1994"},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/S1571-0661(05)80259-2_BIB9"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(05)80259-2_BIB10"},{"year":"1994","series-title":"Computational Complexity","author":"Papadimitriou","key":"10.1016\/S1571-0661(05)80259-2_BIB11"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802592?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802592?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:07:37Z","timestamp":1761610057000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":11,"alternative-id":["S1571066105802592"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80259-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hardness results for weak bisimilarity of simple process algebras","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)80259-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}