{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:41:37Z","timestamp":1725795697527},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_31","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"363-374","source":"Crossref","is-referenced-by-count":7,"title":["Branching Bisimilarity Checking for PRS"],"prefix":"10.1007","author":[{"given":"Qiang","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxi","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaodong","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingzhang","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuting","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-17945-3_5","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of Bisimulation Equivalence for Processes Generating Context-free Languages. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 94\u2013111. Springer, Heidelberg (1987)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on Infinite Structures. In: Handbook of Process Algebra. Elsevier Science (2001)","DOI":"10.1016\/B978-044482830-9\/50027-8"},{"key":"31_CR3","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)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BFb0084788","volume-title":"CONCUR \u201992","author":"S. Christensen","year":"1992","unstructured":"Christensen, S., H\u00fcttel, H., Stirling, C.: Bisimulation Equivalence is Decidable for all Context-free Processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 138\u2013147. Springer, Heidelberg (1992)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-642-23217-6_35","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"W. Czerwi\u0144ski","year":"2011","unstructured":"Czerwi\u0144ski, W., Hofman, P., Lasota, S.: Decidability of Branching Bisimulation on Normed Commutative Context-free Processes. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 528\u2013542. Springer, Heidelberg (2011)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BFb0039058","volume-title":"CONCUR \u201990","author":"R. Nicola De","year":"1990","unstructured":"De Nicola, R., Montanari, U., Vaandrager, F.: Back and Forth Bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 152\u2013165. Springer, Heidelberg (1990)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-39212-2_23","volume-title":"Automata, Languages, and Programming","author":"Y. Fu","year":"2013","unstructured":"Fu, Y.: Checking Equality and Regularity for Normed BPA with Silent Moves. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 238\u2013249. Springer, Heidelberg (2013)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-48523-6_38","volume-title":"Automata, Languages and Programming","author":"Y. Hirshfeld","year":"1999","unstructured":"Hirshfeld, Y., Jerrum, M.: Bisimulation Equivanlence is Decidable for Normed Process Algebra. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 412\u2013421. Springer, Heidelberg (1999)"},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","volume":"148","author":"P. Jan\u010dar","year":"1995","unstructured":"Jan\u010dar, P.: Undecidability of Bisimilarity for Petri Nets and Some Related Problems. Theoretical Computer Science\u00a0148, 281\u2013301 (1995)","journal-title":"Theoretical Computer Science"},{"key":"31_CR10","series-title":"IFIP","first-page":"507","volume-title":"TCS 2004","author":"P. Jan\u010dar","year":"2004","unstructured":"Jan\u010dar, P., Brics, J.S.: Highly Undecidable Questions for Process Algebras. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IFIP, vol.\u00a0155, pp. 507\u2013520. Springer, Boston (2004)"},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1326554.1326559","volume":"55","author":"P. Jan\u010dar","year":"2008","unstructured":"Jan\u010dar, P., Srba, J.: Undecidability of Bisimilarity by Defender\u2019s Forcing. Journal of the ACM\u00a055, 1\u201326 (2008)","journal-title":"Journal of the ACM"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S1471068406002651","volume":"6","author":"A. Ku\u010dera","year":"2006","unstructured":"Ku\u010dera, A., Jan\u010dar, P.: Equivalence-Checking on Infinite-State Systems: Techniques and Results. Theory and Practice of Logic Programming\u00a06, 227\u2013264 (2006)","journal-title":"Theory and Practice of Logic Programming"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process Rewrite Systems. Information and Computation\u00a0156, 264\u2013286 (2000)","journal-title":"Information and Computation"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/3-540-45061-0_46","volume-title":"Automata, Languages and Programming","author":"R. Mayr","year":"2003","unstructured":"Mayr, R.: Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 570\u2013583. Springer, Heidelberg (2003)"},{"key":"31_CR15","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/3-540-45694-5_38","volume-title":"CONCUR 2002 - Concurrency Theory","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Undecidability of Weak Bisimilarity for Pushdown Processes. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 579\u2013594. Springer, Heidelberg (2002)"},{"key":"31_CR18","first-page":"163","volume":"78","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Roadmap of Infinite Results. EATCS\u00a078, 163\u2013175 (2002)","journal-title":"EATCS"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-45005-X_17","volume-title":"Developments in Language Theory","author":"J. Srba","year":"2003","unstructured":"Srba, J.: Undecidability of Weak Bisimilarity for PA-Processes. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 197\u2013208. Springer, Heidelberg (2003)"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Srba, J.: Completeness Results for Undecidable Bisimilarity Problems. Electronic Notes in Computer Science\u00a098, 5\u201319 (2004)","DOI":"10.1016\/j.entcs.2003.10.003"},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0304-3975(97)00216-8","volume":"195","author":"C. Stirling","year":"1998","unstructured":"Stirling, C.: Decidability of Bisimulation Equivalence for Normed Pushdown Processes. Theoretical Computer Science\u00a0195, 113\u2013131 (1998)","journal-title":"Theoretical Computer Science"},{"key":"31_CR22","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":"31_CR23","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)"},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R., Weijland, W.: Branching Time and Abstraction in Bisimulation Semantics. Journal of ACM\u00a043, 555\u2013600 (1996)","journal-title":"Journal of ACM"},{"key":"31_CR25","unstructured":"Yin, Q., Fu, Y., He, C., Huang, M., Tao, X.: Branching Bisimilarity Checking for PRS (2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1402.0050"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:17:39Z","timestamp":1558923459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}