{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:13:27Z","timestamp":1742984007197,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642048548"},{"type":"electronic","value":"9783642048562"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04856-2_10","type":"book-chapter","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T07:41:51Z","timestamp":1257320511000},"page":"244-274","source":"Crossref","is-referenced-by-count":5,"title":["On Bisimulation Theory in Linear Higher-Order \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Xian","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (parts i and ii). Information and Computation\u00a0100(1), 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"10_CR3","volume-title":"The Pi-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The Pi-calculus: a Theory of Mobile Processes. Cambridge Universtity Press, Cambridge (2001)"},{"doi-asserted-by":"crossref","unstructured":"Thomsen, B.: A calculus of higher order communication systems. In: Proceedings of POPL 1989, Austin, Texas, United States, pp. 143\u2013154 (1989)","key":"10_CR4","DOI":"10.1145\/75277.75290"},{"unstructured":"Thomsen, B.: Calculi for Higher Order Communicating Systems. Phd thesis, Department of Computing, Imperial College (1990)","key":"10_CR5"},{"issue":"1","key":"10_CR6","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), 1\u201359 (1993)","journal-title":"Acta Informatica"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1995.1004","volume":"116","author":"B. Thomsen","year":"1995","unstructured":"Thomsen, B.: A theory of higher order communication systems. Information and Computation\u00a0116, 38\u201357 (1995)","journal-title":"Information and Computation"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/inco.1996.0096","volume":"131","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Bisimulation for higher-order process calculi. Information and Computation\u00a0131(2), 141\u2013178 (1996)","journal-title":"Information and Computation"},{"unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms. Phd thesis, University of Edinburgh (1992)","key":"10_CR9"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for \u03c0-calculus. Acta Informatica\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Informatica"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-44685-0_20","volume-title":"CONCUR 2001 - Concurrency Theory","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: On barbed equivalences in pi-calculus. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 292\u2013304. Springer, Heidelberg (2001)"},{"unstructured":"Fu, Y.: Checking equivalence for higher order processes. SJTU BASICS, http:\/\/basics.sjtu.edu.cn\/people (2005) (Find \u2018Yuxi Fu\u2019)","key":"10_CR12"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-79124-9_4","volume-title":"Tests and Proofs","author":"Z. Cao","year":"2008","unstructured":"Cao, Z.: Equivalence checking for a finite higher order pi-calculus. In: Beckert, B., H\u00e4hnle, R. (eds.) TAP 2008. LNCS, vol.\u00a04966, pp. 30\u201347. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Wadler, P.: Linear types can change the world! In: Broy, M., Jones, C. (eds.) IFIP TC 2 Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, pp. 347\u2013359 (1990)","key":"10_CR14","DOI":"10.1145\/99370.99404"},{"unstructured":"VII, T.M.: Linear type systems for communication (2001), http:\/\/www.cs.cmu.edu\/~tom7\/papers\/","key":"10_CR15"},{"doi-asserted-by":"crossref","unstructured":"Lanese, I., Perez, J., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. In: Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008), pp. 145\u2013155 (2008)","key":"10_CR16","DOI":"10.1109\/LICS.2008.8"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.tcs.2006.02.006","volume":"356","author":"M. Bundgaard","year":"2006","unstructured":"Bundgaard, M., Hildebrandt, T., Godskesen, J.C.: A cps encoding of name-passing in higher-order mobile embedded resources. Theoretical Computer Science\u00a0356, 422\u2013439 (2006)","journal-title":"Theoretical Computer Science"},{"unstructured":"Xu, X.: On bisimulation theory in linear higher-order \u03c0-calculus. In: The proceedings of Concurrency Methods: Issues and Applications (CHINA 2008), a satellite workshop of PETRI NETS 2008, Xi\u2019an, China (2008) Technical report CS-TR-1102, School of Computing Science, Newcastle University, UK, http:\/\/basics.sjtu.edu.cn\/~xuxian\/OnBTinLHO.pdf","key":"10_CR18"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner, R.: Functions as processes. Journal of Mathematical Structures in Computer Science\u00a02(2), 119\u2013141 (1992)","journal-title":"Journal of Mathematical Structures in Computer Science"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"unstructured":"Baldamus, M., Frauenstein, T.: Congruence proofs for weak bisimulation equivalences on higher-order process calculi. Technical Report Report 95-21, Berlin University of Technology, Computer Science Department (1995)","key":"10_CR21"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/3-540-59293-8_196","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"R. Amadio","year":"1995","unstructured":"Amadio, R., Dam, M.: Reasoning about higher-order processes. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 202\u2013216. Springer, Heidelberg (1995)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0030604","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"M. Baldamus","year":"1997","unstructured":"Baldamus, M., Dingel, J.: Modal characterization of weak bisimulation for higher-order processes. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 285\u2013296. Springer, Heidelberg (1997)"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(93)90156-N","volume":"114","author":"R. Milner","year":"1993","unstructured":"Milner, R., Parrow, J., Walker, D.: Modal logics for mobile processes. Theoretical Computer Science\u00a0114(1), 149\u2013171 (1993)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Xu, X.: An appendix to on bisimulation theory in linear higher-order pi-calculus (2009), http:\/\/basics.sjtu.edu.cn\/~xuxian\/","key":"10_CR25","DOI":"10.1007\/978-3-642-04856-2_10"},{"unstructured":"Xu, X.: A logical characterization of local bisimulation in linear higher-order \u03c0-calculus. Technical report, BASICS Lab, SJTU (2007)","key":"10_CR26"},{"issue":"1","key":"10_CR27","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1038\/sj.cr.7290260","volume":"15","author":"R. Nusse","year":"2005","unstructured":"Nusse, R.: Wnt signaling in disease and in development. Cell research\u00a015(1), 28\u201332 (2005)","journal-title":"Cell research"},{"issue":"4","key":"10_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1371\/journal.pbio.0040115","volume":"4","author":"L. Gross","year":"2006","unstructured":"Gross, L.: One signal, multiple pathways: Diversity comes from the receptor. PLoS Biol.\u00a04(4), 115\u2013131 (2006)","journal-title":"PLoS Biol."}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency III"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04856-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T02:00:57Z","timestamp":1739412057000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-04856-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642048548","9783642048562"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04856-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}