{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:17:06Z","timestamp":1725495426575},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657033"},{"type":"electronic","value":"9783540490593"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49059-0_21","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T16:56:57Z","timestamp":1194973017000},"page":"300-314","source":"Crossref","is-referenced-by-count":10,"title":["Computing Strong\/Weak Bisimulation Equivalences and Observation Congruence for Value-Passing Processes"],"prefix":"10.1007","author":[{"given":"Zhoujun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huowang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,3,12]]},"reference":[{"key":"21_CR1","unstructured":"G. Bruns. Distributed System Analysis with CCS. Prentice Hall,1996."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","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, pages 36\u201372, 1993.","journal-title":"ACM Transactions on Programming Language and Systems"},{"key":"21_CR3","unstructured":"J. Godskesen, K. Larsen and M. Zeeberg. Tav user manual. Report R89-19, Aalborg University, 1989."},{"key":"21_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":"21_CR5","doi-asserted-by":"crossref","unstructured":"M. Hennessy and H. Lin. Proof systems for message-passing process algebras. Formal Aspects of Computing, No 3, 1996.","DOI":"10.1007\/BF01213531"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/inco.1993.1069","volume":"107","author":"B. Jonsson","year":"1993","unstructured":"B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. Information and computation, 107: 272\u2013302, 1993.","journal-title":"Information and computation"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55179-4","volume-title":"CAV\u201992","author":"K. G. Larsen","year":"1992","unstructured":"K. G. Larsen.Efficient local correctness checking. In CAV\u201992, LNCS. Springer-Verlag, 1992."},{"key":"21_CR8","unstructured":"Z. J. Li. Checking weak bisimulation equivalence and observation congruence for value-passing processes with finite symbolic transiton graphs. Technical report 6\/97, Changsha Institute of Technology, 1997."},{"key":"21_CR9","series-title":"Lect Notes Comput Sci","volume-title":"ICALP\u201998","author":"Z. J. Li","year":"1998","unstructured":"Z. J. Li and H. W. Chen. Checking strong\/weak bisimulation equivalences and observation congruence for the \u03c0-calculus. In ICALP\u201998, LNCS 1443. Springer-Verlag, 1998."},{"key":"21_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0014474","volume-title":"CONCUR\u201996","author":"H. Lin","year":"1996","unstructured":"H. Lin. Symbolic transition graph with assignment. In CONCUR\u201996, LNCS 1119. Springer-Verlag, 1996."},{"key":"21_CR11","unstructured":"X. Liu. Specification and decomposition in concurrency. Ph.D.thesis, Aalborg University, 1992."},{"key":"21_CR12","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall,1989."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49059-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T07:00:40Z","timestamp":1556953240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49059-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657033","9783540490593"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-49059-0_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}