{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:55Z","timestamp":1761610315147,"version":"build-2065373602"},"reference-count":12,"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)80531-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"19-39","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modifications of Expansion Trees for Weak Bisimulation in BPA"],"prefix":"10.1016","volume":"68","author":[{"given":"Jitka","family":"St\u0159\u00edbrn\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"\u010cern\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80531-0_NEWBIB1","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE'87, volume 259 of Lecture Notees in Computer Science. Springer, 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"10.1016\/S1571-0661(04)80531-0_NEWBIB2","doi-asserted-by":"crossref","unstructured":"O. Burkart, D. Caucal, and B. Steffen. An elementary decision procedure for arbitrary context-free processes. In Proceedings of MFCS'95, volume 969 of Lecture Notes in Computer Science, pages 423\u2013433. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60246-1_148"},{"issue":"4","key":"10.1016\/S1571-0661(04)80531-0_NEWBIB3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1990240403391","article-title":"Graphes canoniques de graphes alg\u00e9briques","volume":"volume 24","author":"Caucal","year":"1990","journal-title":"Informatique th\u00e9orique et Applications"},{"key":"10.1016\/S1571-0661(04)80531-0_NEWBIB4","doi-asserted-by":"crossref","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR'92, volume 630 of Lecture Noter in Computer Science, pages 138\u2013147. Springer, 1992.","DOI":"10.1007\/BFb0084788"},{"issue":"32","key":"10.1016\/S1571-0661(04)80531-0_NEWBIB5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","author":"Hennessy","year":"1985","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)80531-0_NEWBIB6","unstructured":"Y. Hirshfeld. Deciding equivalences in simple Process Algebras. Technical report, LFCS Report Series."},{"key":"10.1016\/S1571-0661(04)80531-0_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld. Bisimulation trees and the decidability of weak bisimulation. In Steffen B. and Caucal D., editors, Proceedings of INFINITY'96, volume 5 of ENTCS, 1996.","DOI":"10.1016\/S1571-0661(05)80674-7"},{"key":"10.1016\/S1571-0661(04)80531-0_NEWBIB8","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and F. Moller. Techniques for decidability and undecidability of bisimilarity. In Proceedings of CONCUR'99, volume 1664 of Lecture Notes in Computer Science. Springer, 1999.","DOI":"10.1007\/3-540-48320-9_5"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(04)80531-0_NEWBIB9"},{"key":"10.1016\/S1571-0661(04)80531-0_NEWBIB10","doi-asserted-by":"crossref","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings of GI Conference, pages 167\u2013183, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S1571-0661(04)80531-0_NEWBIB11","doi-asserted-by":"crossref","unstructured":"J. St\u0159\u00edbrn\u00e1. Approximanting weak bisimulation on Basic Process Algebra. In Proceedings of MFCS'99, volume 1672 of Lecture Notes in Computer Science, pages 336\u2013375. Springer, 1999.","DOI":"10.1007\/3-540-48340-3_33"},{"key":"10.1016\/S1571-0661(04)80531-0_NEWBIB12","unstructured":"J. St\u0159\u00edbrn\u00e1. Decidability and complexity of equivalences for simple process algebras. PhD thesis, University of Edinburgh, 1999."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805310?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:06:00Z","timestamp":1761609960000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104805310"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80531-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Modifications of Expansion Trees for Weak Bisimulation in BPA","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)80531-0","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"}]}}