{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T23:04:10Z","timestamp":1784675050381,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540647812","type":"print"},{"value":"9783540686811","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055095","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T08:08:05Z","timestamp":1154419685000},"page":"707-718","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Checking strong\/Weak bisimulation equivalences and observation congruence for the \u03c0-calculus"],"prefix":"10.1007","author":[{"given":"Zhoujun","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huowang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"M.Boreale and R.De Nicola.A symbolic semantics for the \u03c0-calculus. In CONCUR'94,LNCS 836.Springer-Verlag,1994.","DOI":"10.1007\/978-3-540-48654-1_24"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"R.Cleaveland,J.Parrow and B.Steffen.The concurrency workbench: A Semantics based verification tool for the verification of concurrent systems.ACM Transactions on Programming Language and Systems,Vol.15,No.1,1993.","DOI":"10.1145\/151646.151648"},{"key":"60_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/S0304-3975(96)00325-8","volume":"183","author":"M. Dam","year":"1997","unstructured":"M.Dam.On the decidability of process equivalence for the \u03c0-calculus. Theoretical Computer Science, 183:214\u2013228, 1997.","journal-title":"Theoretical Computer Science"},{"key":"60_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"M.Hennessy and H.Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353\u2013389, 1995.","journal-title":"Theoretical Computer Science"},{"key":"60_CR5","unstructured":"H.Lin. Symbolic bisimulations and proof systems for the \u03c0-calculus. Report 7\/94, Computer Science, University of Sussex,1994."},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"H.Lin. Complete inference systems for weak bisimulation equivalences in the \u03c0-calculus. In TAPSOFT'95. Spring-Verlag, 1995.","DOI":"10.1007\/3-540-59293-8_195"},{"key":"60_CR7","doi-asserted-by":"crossref","unstructured":"H.Lin. Symbolic transition graph with assignment. In CONCUR'96, LNCS 1119. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_47"},{"key":"60_CR8","doi-asserted-by":"crossref","unstructured":"Z.J.Li.Checking strong\/weak bisimulation equivalences and observation congruence for value-passing processes and the \u03c0-calculus processes. Forthcoming Ph.D.thesis,Changsha Institute of Technology, 1998.","DOI":"10.1007\/3-540-49059-0_21"},{"key":"60_CR9","unstructured":"R.Milner. Communication and Concurrency.Prentice-Hall,1989."},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R.Milner. J.Parrow and D.Walker, A calculus of mobile processes, Part I,II.Information and Computation, 100:1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"60_CR11","doi-asserted-by":"crossref","unstructured":"U.Montanari and M.Pistore. Checking bisimilarity for finitary \u03c0-calculus. In CONCUR'95,LNCS 962. Springer Verlag, 1995.","DOI":"10.1007\/3-540-60218-6_4"},{"key":"60_CR12","doi-asserted-by":"crossref","unstructured":"M.Pistore and D.Sangiorgi.A partition refinement algorithm for the \u03c0-calculus. In CAV'96,LNCS 1102. Spinger-Verlag, 1996.","DOI":"10.1007\/3-540-61474-5_56"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"D.Sangiorgi.A theory of bisimulation for the \u03c0-calculus. In CONCUR'93,LNCS 715. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57208-2_10"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"B.Victor and F.Moller. The mobility workbench-a tool for the \u03c0-calculus. In CAV'94,LNCS 818. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58179-0_73"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:46:53Z","timestamp":1578494813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055095"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0055095","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}