{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:30:49Z","timestamp":1775097049231,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T00:00:00Z","timestamp":1380412800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00224-013-9505-9","type":"journal-article","created":{"date-parts":[[2013,9,28]],"date-time":"2013-09-28T04:26:47Z","timestamp":1380342407000},"page":"136-169","source":"Crossref","is-referenced-by-count":3,"title":["Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes"],"prefix":"10.1007","volume":"55","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Hofman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u0142awomir","family":"Lasota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,29]]},"reference":[{"key":"9505_CR1","unstructured":"Christensen, S.: Decidability and decomposition in process algebras. Ph.D. thesis, Dept. of Computer Science, University of Edinburgh, UK (1993)"},{"key":"9505_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"CONCUR","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation equivalence is decidable for basic parallel processes. In: CONCUR, pp.\u00a0143\u2013157 (1993)"},{"key":"9505_CR3","first-page":"528","volume-title":"CONCUR","author":"W. Czerwinski","year":"2011","unstructured":"Czerwinski, W., Hofman, P., Lasota, S.: Decidability of branching bisimulation on normed commutative context-free processes. In: CONCUR, pp.\u00a0528\u2013542 (2011)"},{"issue":"1","key":"9505_CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundam. Inform. 31(1), 13\u201325 (1997)","journal-title":"Fundam. Inform."},{"key":"9505_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.entcs.2009.05.028","volume":"239","author":"S. Fr\u00f6schle","year":"2009","unstructured":"Fr\u00f6schle, S., Lasota, S.: Normed processes, unique decomposition, and complexity of bisimulation equivalences. Electron. Notes Theor. Comput. Sci. 239, 17\u201342 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"9505_CR6","unstructured":"Hirshfeld, Y.: Congruences in commutative semigroups. Technical report, LFCS report ECS-LFCS-94-291, University of Edinburgh (1994)"},{"issue":"3","key":"9505_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1017\/S0960129500000992","volume":"6","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A\u00a0polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes. Math. Struct. Comput. Sci. 6(3), 251\u2013259 (1996)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9505_CR8","first-page":"99","volume-title":"DCM","author":"P. Hofman","year":"2012","unstructured":"Hofman, P., Totzke, P.: Approximating weak bisimilarity of basic parallel processes. In: DCM, pp.\u00a099\u2013113 (2012)"},{"key":"9505_CR9","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/3-540-57785-8_173","volume-title":"STACS","author":"P. Jancar","year":"1994","unstructured":"Jancar, P.: Decidability questions for bismilarity of Petri nets and some related problems. In: STACS, pp.\u00a0581\u2013592 (1994)"},{"key":"9505_CR10","first-page":"218","volume-title":"LICS","author":"P. Jancar","year":"2003","unstructured":"Jancar, P.: Strong bisimilarity on basic parallel processes is PSPACE-complete. In: LICS, pp.\u00a0218\u2013227 (2003)"},{"key":"9505_CR11","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.tcs.2006.02.020","volume":"360","author":"S. Lasota","year":"2006","unstructured":"Lasota, S.: Decidability of performance equivalence for basic parallel processes. Theor. Comput. Sci. 360, 172\u2013192 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9505_CR12","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1995","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, New York (1995)"},{"key":"9505_CR13","first-page":"535","volume-title":"STACS","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Strong bisimilarity and regularity of basic parallel processes is PSPACE-hard. In: STACS, pp.\u00a0535\u2013546 (2002)"},{"key":"9505_CR14","volume-title":"Roadmap of Infinite Results, vol 2: Formal Models and Semantics","author":"J. Srba","year":"2004","unstructured":"Srba, J.: Roadmap of Infinite Results, vol 2: Formal Models and Semantics. World Scientific, Singapore (2004)"},{"key":"9505_CR15","first-page":"142","volume-title":"MFCS","author":"C. Stirling","year":"1998","unstructured":"Stirling, C.: The joys of bisimulation. In: MFCS, pp.\u00a0142\u2013151 (1998)"},{"key":"9505_CR16","first-page":"379","volume-title":"FoSSaCS","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Decidability of weak bisimilarity for a subset of basic parallel processes. In: FoSSaCS, pp.\u00a0379\u2013393 (2001)"},{"key":"9505_CR17","unstructured":"Stribrna, J.: Decidability and complexity of equivalences for simple process algebras. Ph.D. thesis, Dept. of Computer Science, University of Edinburgh, UK (1998)"},{"key":"9505_CR18","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The linear time\u2014branching time spectrum II. In: CONCUR, pp.\u00a066\u201381 (1993)"},{"issue":"3","key":"9505_CR19","first-page":"555","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J.\u00a0ACM 43(3), 555\u2013600 (1996)","journal-title":"J.\u00a0ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9505-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9505-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9505-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T00:55:27Z","timestamp":1596588927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9505-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,29]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9505"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9505-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,29]]}}}