{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:28Z","timestamp":1725565888127},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_39","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"445-456","source":"Crossref","is-referenced-by-count":6,"title":["Towards an Algebraic Theory of Typed Mobile Processes"],"prefix":"10.1007","author":[{"given":"Yuxin","family":"Deng","sequence":"first","affiliation":[]},{"given":"Davide","family":"Sangiorgi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1006\/inco.1995.1114","volume":"120","author":"M. Boreale","year":"1995","unstructured":"Boreale, M., De Nicola, R.: Testing equivalences for mobile processes. Journal of Information and Computation\u00a0120, 279\u2013303 (1995)","journal-title":"Journal of Information and Computation"},{"key":"39_CR2","volume-title":"Proceedings of LICS 1998","author":"M. Boreale","year":"1998","unstructured":"Boreale, M., Sangiorgi, D.: Bisimulation in name-passing calculi without matching. In: Proceedings of LICS 1998, July 1998, IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"39_CR3","unstructured":"Deng, Y., Sangiorgi, D.: Towards an algebraic theory of typed mobile processes (full version), http:\/\/www-sop.inria.fr\/mimosa\/personnel\/Davide.Sangiorgi\/mypapers.html"},{"key":"#cr-split#-39_CR4.1","doi-asserted-by":"crossref","unstructured":"Hennessy, M., Rathke, J.: Typed behavioural equivalences for processes in the presence of subtyping (2003);","DOI":"10.1016\/S1571-0661(04)00309-3"},{"key":"#cr-split#-39_CR4.2","unstructured":"To appear in Mathematical Structures in Computer Science"},{"key":"39_CR5","series-title":"ENTCS","first-page":"3","volume-title":"Proceedings of HLCL 1998","author":"M. Hennessy","year":"1998","unstructured":"Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. In: Nestmann, U., Pierce, B.C. (eds.) Proceedings of HLCL 1998. ENTCS, vol.\u00a016.3, pp. 3\u201317. Elsevier Science Publishers, Amsterdam (1998)"},{"key":"39_CR6","unstructured":"Lin, H.: Symbolic bisimulation and proof systems for the \u03c0-calculus. Technical Report 7\/94, School of Cognitive and Computing Sciences, University of Sussex, UK (1994)"},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-59293-8_195","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"H. Lin","year":"1995","unstructured":"Lin, H.: Complete inference systems for weak bisimulation equivalences in the \u03c0- calculus. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 187\u2013201. Springer, Heidelberg (1995)"},{"key":"39_CR8","volume-title":"Communicating and Mobile Systems: the \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus, May 1999. Cambridge University Press, Cambridge (1999)"},{"issue":"2","key":"39_CR9","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. Journal of Information and Computation\u00a0120(2), 174\u2013197 (1995)","journal-title":"Journal of Information and Computation"},{"issue":"5","key":"39_CR10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B.C. Pierce","year":"1996","unstructured":"Pierce, B.C., Sangiorgi, D.: Typing and subtyping for mobile processes. Mathematical Structures in Computer Science\u00a06(5), 409\u2013454 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"39_CR11","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 the \u03c0-calculus. Acta Informatica\u00a033, 69\u201397 (1996)","journal-title":"Acta Informatica"},{"key":"39_CR12","volume-title":"The \u03c0-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:56Z","timestamp":1605759836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}