{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:40:04Z","timestamp":1743075604462,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642307669"},{"type":"electronic","value":"9783642307676"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30767-6_17","type":"book-chapter","created":{"date-parts":[[2012,5,7]],"date-time":"2012-05-07T10:41:50Z","timestamp":1336387310000},"page":"198-209","source":"Crossref","is-referenced-by-count":3,"title":["A Fully Abstract View for Local Cause Semantics"],"prefix":"10.1007","author":[{"given":"Jianxin","family":"Xue","sequence":"first","affiliation":[]},{"given":"Xiaoju","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-540-68679-8_47","volume-title":"Concurrency, Graphs and Models","author":"G. Boudol","year":"2008","unstructured":"Boudol, G., Castellani, I., Hennessy, M., Nielsen, M., Winskel, G.: Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Montanari Festschrift. LNCS, vol.\u00a05065, pp. 757\u2013777. Springer, Heidelberg (2008)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/BFb0084786","volume-title":"CONCUR \u201992","author":"G. Boudol","year":"1992","unstructured":"Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: A Theory of Processes with Localities. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 108\u2013122. Springer, Heidelberg (1992)"},{"issue":"5","key":"17_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s002360050124","volume":"35","author":"M. Boreale","year":"1998","unstructured":"Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the \u03c0-calculus. Acta Inf.\u00a035(5), 353\u2013400 (1998)","journal-title":"Acta Inf."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BFb0039058","volume-title":"CONCUR \u201990","author":"R. Nicola De","year":"1990","unstructured":"De Nicola, R., Mantanari, U., Vaandrager, F.: Back and Forth Bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 152\u2013165. Springer, Heidelberg (1990)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/3-540-55719-9_110","volume-title":"Automata, Languages and Programming","author":"P. Degano","year":"1992","unstructured":"Degano, P., Priami, C.: Proved Trees. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 629\u2013640. Springer, Heidelberg (1992)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(99)80003-6","volume":"216","author":"P. Degano","year":"1999","unstructured":"Degano, P., Priami, C.: Non-interleaving semantics for mobile processes. Theoretical Computer Science\u00a0216, 237\u2013270 (1999)","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.tcs.2009.11.011","volume":"411","author":"Y. Fu","year":"2010","unstructured":"Fu, Y., Lu, H.: On the expressiveness of interaction. Theoretical Computer Science\u00a0411, 1387\u20131451 (2010)","journal-title":"Theoretical Computer Science"},{"key":"17_CR8","unstructured":"Fu, Y., Zhu, H.: The name-passing calculus (2011) (submitted)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/3-540-57182-5_46","volume-title":"Mathematical Foundations of Computer Science 1993","author":"A. Kiehn","year":"1993","unstructured":"Kiehn, A.: Proof Systems for Cause Based Equivalences. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 547\u2013556. Springer, Heidelberg (1993)"},{"issue":"8","key":"17_CR10","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF01178730","volume":"31","author":"A. Kiehn","year":"1994","unstructured":"Kiehn, A.: Comparing locality and causality based equivalences. Acta Informatica\u00a031(8), 697\u2013718 (1994)","journal-title":"Acta Informatica"},{"key":"17_CR11","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Milner, R.: The polyadic \u03c0-calculus: a tutorial. In: Proceedings of the 1991 Marktoberdorf Summer School on Logic and Algebra of Specification. NATO ASI, Series F, Springer (1993)","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Moller, F.: The nonexistence of finite axiomatisations for ccs congruences. In: LICS 1990, pp. 142\u2013153 (1990)","DOI":"10.1109\/LICS.1990.113741"},{"key":"17_CR14","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. Information and Computation\u00a0100, 1\u201340, (Part I), 41\u201377 (Part II) (1992)","journal-title":"Information and Computation"},{"key":"17_CR15","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First Order and Higher Order Paradigm. PhD thesis, Department of Computer Science, University of Edinburgh (1992)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-57887-0_107","volume-title":"Theoretical Aspects of Computer Software","author":"D. Sangiorgi","year":"1994","unstructured":"Sangiorgi, D.: Locality and True-Concurrency in Calculi for Mobile Processes. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 405\u2013424. Springer, Heidelberg (1994)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Xue, J., Dong, X.: A fully abstract view for local cause semantics (2012) full version, http:\/\/basics.sjtu.edu.cn\/~jianxin\/","DOI":"10.1007\/978-3-642-30767-6_17"},{"key":"17_CR18","unstructured":"Zhu, H.: Model Independent Theory of Mobile Calculi. PhD thesis, Shanghai Jiao Tong University (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Grid and Pervasive Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30767-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:17:15Z","timestamp":1743074235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30767-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307669","9783642307676"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30767-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}