{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:29:06Z","timestamp":1725506946660},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540791232"},{"type":"electronic","value":"9783540791249"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79124-9_4","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T07:07:46Z","timestamp":1207206466000},"page":"30-47","source":"Crossref","is-referenced-by-count":3,"title":["Equivalence Checking for a Finite Higher Order \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Zining","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Lin, H.: Symbolic bisimulations. Theoretical Computer Science\u00a0138, 353\u2013389 (1995)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01213531","volume":"8","author":"M. Hennessy","year":"1996","unstructured":"Hennessy, M., Lin, H.: Proof systems for message-passing process algebras. Formal Aspects of Computing\u00a08, 379\u2013407 (1996)","journal-title":"Formal Aspects of Computing"},{"key":"4_CR3","volume-title":"Proceedings of Mathematical Foundations of Programming Semantics","author":"A. Jeffrey","year":"2003","unstructured":"Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order \u03c0-calculus revisited. In: Proceedings of Mathematical Foundations of Programming Semantics, Elsevier, Amsterdam (2003)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/inco.1993.1069","volume":"107","author":"B. Jonsson","year":"1993","unstructured":"Jonsson, B., Parrow, J.: Deciding bisimulation equivalences for a class of non-finite-state program. Information and Computation\u00a0107, 272\u2013302 (1993)","journal-title":"Information and Computation"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-56496-9_4","volume-title":"Computer Aided Verification","author":"K.G. Larsen","year":"1993","unstructured":"Larsen, K.G.: Efficient local correctness checking (extended abstract). In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 30\u201343. Springer, Heidelberg (1993)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/BFb0055095","volume-title":"Automata, Languages and Programming","author":"Z. Li","year":"1998","unstructured":"Li, Z., Chen, H.: Checking strong\/weak bisimulation equivalences and observation congruence for the \u03c0-calculus. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 707\u2013718. Springer, Heidelberg (1998)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BFb0055074","volume-title":"Automata, Languages and Programming","author":"H. Lin","year":"1998","unstructured":"Lin, H.: Complete proof systems for observation congruence in finite-control \u03c0-calculus. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 443\u2013454. Springer, Heidelberg (1998)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02951922","volume":"15","author":"H. Lin","year":"2000","unstructured":"Lin, H.: Computing bisimulations for finite-control \u03c0 -calculus. Journal of Computer Science and Technology\u00a015(1), 1\u20139 (2000)","journal-title":"Journal of Computer Science and Technology"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(02)00014-7","volume":"180","author":"H. Lin","year":"2003","unstructured":"Lin, H.: Complete inference systems for weak bisimulation equivalences in the \u03c0-calculus. Information and Computation\u00a0180(1), 1\u201329 (2003)","journal-title":"Information and Computation"},{"key":"4_CR10","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"4_CR11","volume-title":"Handbook of Process Algebra","author":"J. Parrow","year":"2001","unstructured":"Parrow, J.: An introduction to the \u03c0-calculus. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, North-Holland, Amsterdam (2001)"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/inco.1995.1108","volume":"120","author":"J. Parrow","year":"1995","unstructured":"Parrow, J., Sangiorgi, D.: Algebraic theories for name-passing calculi. Information and Computation\u00a0120(2), 174\u2013197 (1995)","journal-title":"Information and Computation"},{"key":"4_CR13","unstructured":"Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.D thesis, Department of Computer Science, University of Einburgh (1992)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Bisimulation in higher-order calculi. Information and Computation\u00a0131(2) (1996)","DOI":"10.1006\/inco.1996.0096"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Thomsen, B.: Calculus for higher order communicating systems. Ph.D thesis, Department of Computer, Imperial College (1990)","DOI":"10.1145\/75277.75290"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01200262","volume":"30","author":"B. Thomsen","year":"1993","unstructured":"Thomsen, B.: Plain CHOCS: A second generation calculus for higher order processes. Acta Informatica\u00a030, 1\u201359 (1993)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79124-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:10:58Z","timestamp":1619521858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79124-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540791232","9783540791249"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79124-9_4","relation":{},"subject":[]}}