{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:33:01Z","timestamp":1760146381061},"reference-count":39,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"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":[[2002,1]]},"DOI":"10.1016\/s0304-3975(01)00094-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:05:14Z","timestamp":1027577114000},"page":"677-700","source":"Crossref","is-referenced-by-count":12,"title":["Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time"],"prefix":"10.1016","volume":"270","author":[{"given":"Anton\u0131\u0301n","family":"Ku\u010dera","sequence":"first","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00094-9_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":"Baeten","year":"1993","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB2","volume":"vol. 18","author":"Baeten","year":"1990"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB3","first-page":"135","article-title":"Reachability analysis of pushdown automata: application to model checking","volume":"vol. 1243","author":"Bouajjani","year":"1997"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB4","first-page":"423","article-title":"An elementary decision procedure for arbitrary context-free processes","volume":"vol. 969","author":"Burkart","year":"1995"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB5","doi-asserted-by":"crossref","unstructured":"O. Burkart, J. Esparza, More infinite results, Electron. Notes Theoret. Comput. Sci. 5 (1997).","DOI":"10.1016\/S1571-0661(05)80680-2"},{"issue":"4","key":"10.1016\/S0304-3975(01)00094-9_BIB6","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1990240403391","article-title":"Graphes canoniques des graphes alg\u00e9briques","volume":"24","author":"Caucal","year":"1990","journal-title":"Inform. Th\u00e9or. Appl. (RAIRO)"},{"issue":"3","key":"10.1016\/S0304-3975(01)00094-9_BIB7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s002360050159","article-title":"Comparing expressibility of normed BPA and normed BPP processes","volume":"36","author":"\u010cern\u00e1","year":"1999","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB8","unstructured":"S. Christensen, Decidability and decomposition in process algebras, Ph.D. Thesis, The University of Edinburgh, 1993."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB9","first-page":"143","article-title":"Bisimulation is decidable for all basic parallel processes","volume":"vol. 715","author":"Christensen","year":"1993"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/inco.1995.1129","article-title":"Bisimulation equivalence is decidable for all context-free processes","volume":"121","author":"Christensen","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB11","first-page":"221","article-title":"Petri nets, commutative context-free grammars, and basic parallel processes","volume":"vol. 965","author":"Esparza","year":"1995"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s002360050074","article-title":"Decidability of model checking for infinite-state concurrent systems","volume":"34","author":"Esparza","year":"1997","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB13","first-page":"14","article-title":"An automata-theoretic approach to interprocedural data-flow analysis","volume":"vol. 1578","author":"Esparza","year":"1999"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","article-title":"A short proof of the decidability of bisimulation for normed BPA processes","volume":"42","author":"Groote","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB15","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld, Bisimulation trees and the decidability of weak bisimulations, Electron. Notes Theoret. Comput. Sci. 5 (1996).","DOI":"10.1016\/S1571-0661(05)80674-7"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB16","first-page":"412","article-title":"Bisimulation equivalence is decidable for normed process algebra","volume":"vol. 1644","author":"Hirshfeld","year":"1999"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB17","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","article-title":"A polynomial algorithm for deciding bisimilarity of normed context-free processes","volume":"158","author":"Hirshfeld","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1017\/S0960129500000992","article-title":"A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes","volume":"6","author":"Hirshfeld","year":"1996","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB19","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB20","series-title":"Proc. LICS\u201991","first-page":"376","article-title":"Actions speak louder than words: proving bisimilarity for context-free processes","author":"H\u00fcttel","year":"1991"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB21","first-page":"200","article-title":"Deciding bisimulation-like equivalences with finite-state processes","volume":"vol. 1443","author":"Jan\u010dar","year":"1998"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(01)00094-9_BIB22","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0304-3975(98)00201-1","article-title":"Effective decomposability of sequential behaviours","volume":"242","author":"Ku\u010dera","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB23","first-page":"317","article-title":"Efficient verification algorithms for one-counter processes","volume":"vol. 1853","author":"Ku\u010dera","year":"2000"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB24","first-page":"503","article-title":"Simulation preorder on simple process algebras","volume":"vol. 1644","author":"Ku\u010dera","year":"1999"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB25","first-page":"133","article-title":"On simulation-checking with sequential systems","volume":"vol. 1961","author":"Ku\u010dera","year":"2000"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB26","first-page":"88","article-title":"Weak bisimulation and model checking for basic parallel processes","volume":"vol. 1180","author":"Mayr","year":"1996"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB27","doi-asserted-by":"crossref","unstructured":"R. Mayr, Strict lower bounds for model checking BPA, Electron. Notes Theoret. Comput. Sci. 18 (1998).","DOI":"10.1016\/S1571-0661(05)80256-7"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB28","first-page":"329","article-title":"On the complexity of bisimulation problems for basic parallel processes","volume":"vol. 1853","author":"Mayr","year":"2000"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB29","article-title":"On the complexity of bisimulation problems for pushdown automata","volume":"vol. 1872","author":"Mayr","year":"2000"},{"issue":"1","key":"10.1016\/S0304-3975(01)00094-9_BIB30","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1006\/inco.1999.2826","article-title":"Process rewrite systems","volume":"156","author":"Mayr","year":"2000","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB31","unstructured":"R. Mayr, Decidability of model checking with the temporal logic EF, Theoret. Comput. Sci. (2000), to appear."},{"key":"10.1016\/S0304-3975(01)00094-9_BIB32","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB33","first-page":"195","article-title":"Infinite results","volume":"vol. 1119","author":"Moller","year":"1996"},{"issue":"6","key":"10.1016\/S0304-3975(01)00094-9_BIB34","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(01)00094-9_BIB35","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB36","series-title":"Petri Net Theory and the Modelling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB37","doi-asserted-by":"crossref","unstructured":"J. Srba, Complexity of weak bisimilarity and regularity for BPA and BPP, in: Proc. EXPRESS 2000, Electronic Notes in Theoretical Computer Science, 2000.","DOI":"10.7146\/brics.v7i16.20143"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB38","doi-asserted-by":"crossref","unstructured":"J. St\u0159\u0131\u0301brn\u00e1, Hardness results for weak bisimilarity of simple process algebras, Electron. Notes Theoret. Comput. Sci. 18 (1998).","DOI":"10.1016\/S1571-0661(05)80259-2"},{"key":"10.1016\/S0304-3975(01)00094-9_BIB39","first-page":"127","article-title":"Model checking CTL properties of pushdown systems","volume":"vol. 1974","author":"Walukiewicz","year":"2000"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000949?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000949?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:25:42Z","timestamp":1578428742000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000949"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00094-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}