{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:05:34Z","timestamp":1725602734953},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_35","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T13:14:02Z","timestamp":1314278042000},"page":"528-542","source":"Crossref","is-referenced-by-count":5,"title":["Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Hofman","sequence":"additional","affiliation":[]},{"given":"S\u0142awomir","family":"Lasota","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Christensen, S.: Decidability and Decomposition in process algebras. PhD thesis, Dept. of Computer Science, University of Edinburgh, UK (1993)"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"CONCUR\u201993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation equivalence is decidable for Basic Parallel Processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 143\u2013157. Springer, Heidelberg (1993)"},{"issue":"1","key":"35_CR3","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.\u00a031(1), 13\u201325 (1997)","journal-title":"Fundam. Inform."},{"key":"35_CR4","doi-asserted-by":"publisher","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. Electr. Notes Theor. Comp. Sci.\u00a0239, 17\u201342 (2009)","journal-title":"Electr. Notes Theor. Comp. Sci."},{"key":"35_CR5","unstructured":"Hirshfeld, Y.: Congruences in commutative semigroups. Technical report, University of Edinburgh, LFCS report ECS-LFCS-94-291 (1994)"},{"issue":"3","key":"35_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1017\/S0960129500000992","volume":"6","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes. Mathematical Structures in Computer Science\u00a06(3), 251\u2013259 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-57785-8_173","volume-title":"STACS 94","author":"P. Jancar","year":"1994","unstructured":"Jancar, P.: Decidability questions for bismilarity of Petri nets and some related problems. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 581\u2013592. Springer, Heidelberg (1994)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Jancar, P.: Strong bisimilarity on Basic Parallel Processes is PSPACE-complete. In: LICS, pp. 218\u2013227 (2003)","DOI":"10.1109\/LICS.2003.1210061"},{"key":"35_CR9","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0360, 172\u2013192 (2006)","journal-title":"Theoretical Computer Science"},{"key":"35_CR10","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1995)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/3-540-45841-7_44","volume-title":"STACS 2002","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 535\u2013546. Springer, Heidelberg (2002)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Srba, J.: Roadmap of Infinite results. Formal Models and Semantics, vol.\u00a02. World Scientific Publishing Co., Singapore (2004)","DOI":"10.1142\/9789812562494_0054"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BFb0055763","volume-title":"Mathematical Foundations of Computer Science 1998","author":"C. Stirling","year":"1998","unstructured":"Stirling, C.: The joys of bisimulation. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 142\u2013151. Springer, Heidelberg (1998)"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-45315-6_25","volume-title":"Foundations of Software Science and Computation Structures","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 379\u2013393. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T17:43:04Z","timestamp":1592847784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}