{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T23:47:43Z","timestamp":1738194463484,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_17","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"192-203","source":"Crossref","is-referenced-by-count":1,"title":["More on Weak Bisimilarity of Normed Basic Parallel Processes"],"prefix":"10.1007","author":[{"given":"Haiyan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"CONCUR \u201996: Concurrency Theory","author":"F. Moller","year":"1996","unstructured":"Moller, F.: Infinite results. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 195\u2013216. Springer, Heidelberg (1996)"},{"issue":"40","key":"17_CR2","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","volume":"93","author":"J.C.M. Baeten","year":"1993","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the Association for Computing Machinery\u00a093(40), 653\u2013682 (1993)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"17_CR3","unstructured":"Christensen, S.: Forthcoming Ph.D. thesis. University of Edinburgh"},{"key":"17_CR4","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., Moller, F.: Bisimulation equivalence 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":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-60249-6_54","volume-title":"Fundamentals of Computation Theory","author":"J. Esparza","year":"1995","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 221\u2013232. Springer, Heidelberg (1995)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Hirshfeld, Y.: Bisimulation trees and the decidability of weak bisimulations. In: INFINITY 1996. Proceedings of the 1st International Workshop on Verification of Infinite State Systems, Germany, vol.\u00a05 (1996)","DOI":"10.1016\/S1571-0661(05)01228-4"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"H\u00fcttel, H., Stirling, C.: Actions speak louder than words. Proving bisimilarity for context-free processes. In: LICS 1991. Proceedings of 6th Annual symposium on Logic in Computer Science, Amsterdam, pp. 376\u2013386 (1991)","DOI":"10.1109\/LICS.1991.151661"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"R., Milner: A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980)"},{"key":"17_CR9","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall International, Englewood Cliffs (1989)"},{"key":"17_CR10","first-page":"50","volume-title":"Prodeedings of REX Workshop","author":"J.A. Bergstra","year":"1988","unstructured":"Bergstra, J.A., Klop, J.W.: Process theory based on bisimulation semantics. In: Prodeedings of REX Workshop, pp. 50\u2013122. The Netherlands, Amsterdam (1988)"},{"issue":"4","key":"17_CR11","first-page":"339","volume":"90-24","author":"D. Caucal","year":"1990","unstructured":"Caucal, D.: Graphes canoniques de graphes alg\u00e9briques. Informatique th\u00e9orique et Applications(RAIRO)\u00a090-24(4), 339\u2013352 (1990)","journal-title":"Informatique th\u00e9orique et Applications(RAIRO)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dixon","year":"1913","unstructured":"Dixon, L.E.: Finiteness of the odd perfct and primitive abundant numbers with distinct factors. American Journal of Mathematics\u00a035, 413\u2013422 (1913)","journal-title":"American Journal of Mathematics"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Christensen, S., Hirshfield, Y., Moller, F.: Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes. In: LICS 1993. Proceedings of the Eighth Annual Symposium on Logic in Computer Science, Montreal, Canada, pp. 386\u2013396 (1993)","DOI":"10.1109\/LICS.1993.287569"},{"key":"17_CR14","unstructured":"Jan $\\check{c}$ ar, P.: Strong bisimilarity on basic parallel processes is PSPACE-complete. In: LICS 2003. Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, Ottawa, Canada, pp. 218-227 (2003)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"97-34","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Decidability of model checking for infinite-state concurrent systems. Acta Informatica\u00a097-34, 85\u2013107 (1997)","journal-title":"Acta Informatica"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Burkart, O., Esparza, J.: More infinite results. Electronic Notes in Theoretical computer Science\u00a05 (1997)","DOI":"10.1016\/S1571-0661(05)80680-2"},{"key":"17_CR17","first-page":"163","volume":"78","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Roadmap of Infinite Results. Bulletin of the European Association for Theoretical Computer Science\u00a078, 163\u2013175 (2002), columns:Concurrency","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45022-X_29","volume-title":"Automata, Languages and Programming","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: On the Complexity of Bisimulation Problems for Basic Parallel Processes. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 329\u2013341. Springer, Heidelberg (2000)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-62034-6_40","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R. Mayr","year":"1996","unstructured":"Mayr, R.: Weak Bisimulation and Model Checking for Basic Parallel Processes. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 88\u201399. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T23:02:39Z","timestamp":1738191759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_17","relation":{},"subject":[]}}