{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:05Z","timestamp":1725559745364},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_99","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"1226-1238","source":"Crossref","is-referenced-by-count":8,"title":["Basic Observables for a Calculus for Global Computing"],"prefix":"10.1007","author":[{"given":"Rocco","family":"De Nicola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Gorla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosario","family":"Pugliese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"99_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-3975(99)00230-3","volume":"240","author":"R.M. Amadio","year":"2000","unstructured":"Amadio, R.M.: On modelling mobility. Theor. Comp. Sci.\u00a0240(1), 147\u2013176 (2000)","journal-title":"Theor. Comp. Sci."},{"key":"99_CR2","first-page":"110","volume-title":"Proc. of the 7th WETICE","author":"L. Bettini","year":"1998","unstructured":"Bettini, L., De Nicola, R., Ferrari, G., Pugliese, R.: Interactive Mobile Agents in X-Klaim. In: Proc. of the 7th WETICE, pp. 110\u2013115. IEEE, Los Alamitos (1998)"},{"key":"99_CR3","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. Information and Computation\u00a0120, 279\u2013303 (1995)","journal-title":"Information and Computation"},{"issue":"1","key":"99_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1006\/inco.1998.2755","volume":"149","author":"M. Boreale","year":"1999","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Basic observables for processes. Information and Computation\u00a0149(1), 77\u201398 (1999)","journal-title":"Information and Computation"},{"key":"99_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/inco.2001.3080","volume":"172","author":"M. Boreale","year":"2002","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Trace and testing equivalence on asynchronous processes. Information and Computation\u00a0172, 139\u2013164 (2002)","journal-title":"Information and Computation"},{"key":"99_CR6","unstructured":"Bugliesi, M., Crafa, S., Merro, M., Sassone, V.: Communication and Mobility Control in Boxed Ambients. To appear in Information and Computation"},{"issue":"1","key":"99_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. TCS\u00a0240(1), 177\u2013213 (2000)","journal-title":"TCS"},{"key":"99_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-36206-1_9","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"G. Castagna","year":"2002","unstructured":"Castagna, G., Zappa Nardelli, F.: The Seal Calculus Revisited: contextual equivalence and bisimilarity. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 85\u201396. Springer, Heidelberg (2002)"},{"issue":"5","key":"99_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/32.685256","volume":"24","author":"R. De Nicola","year":"1998","unstructured":"De Nicola, R., Ferrari, G., Pugliese, R.: Klaim: a Kernel Language for Agents Interaction and Mobility. IEEE Transactions on Software Engineering\u00a024(5), 315\u2013330 (1998)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"99_CR10","unstructured":"De Nicola, R., Gorla, D., Pugliese, R.: Basic observables for a calculus for global computing. Tech. Rep. 07\/2004, Dip. Informatica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d (2004)"},{"key":"99_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11417019_11","volume-title":"Coordination Models and Languages","author":"R. Nicola De","year":"2005","unstructured":"De Nicola, R., Gorla, D., Pugliese, R.: Global Computing in a Dynamic Network of Tuple Spaces. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol.\u00a03454, pp. 157\u2013172. Springer, Heidelberg (2005)"},{"key":"99_CR12","doi-asserted-by":"crossref","unstructured":"De Nicola, R., Gorla, D., Pugliese, R.: On the Expressive Power of Klaim-based Calculi. In: Proc. of EXPRESS. ENTCS, vol.\u00a0128(2), pp. 117\u2013130 (2004)","DOI":"10.1016\/j.entcs.2004.11.032"},{"key":"99_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalence for processes. TCS\u00a034, 83\u2013133 (1984)","journal-title":"TCS"},{"key":"99_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/3-540-61604-7_67","volume-title":"CONCUR \u201996: Concurrency Theory","author":"C. Fournet","year":"1996","unstructured":"Fournet, C., Gonthier, G., L\u00e9vy, J.-J., Maranget, L., R\u00e9my, D.: A calculus of mobile agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 406\u2013421. Springer, Heidelberg (1996)"},{"key":"99_CR15","doi-asserted-by":"crossref","unstructured":"Francalanza, A., Hennessy, M.: A Theory of System Behaviour in the Presence of Node and Link Failures. Tech. Rep. cs01:2005, Univ. of Sussex","DOI":"10.1007\/11539452_29"},{"issue":"1","key":"99_CR16","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2363.2433","volume":"7","author":"D. Gelernter","year":"1985","unstructured":"Gelernter, D.: Generative communication in linda. TOPLAS\u00a07(1), 80\u2013112 (1985)","journal-title":"TOPLAS"},{"key":"99_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-36576-1_18","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Hennessy","year":"2003","unstructured":"Hennessy, M., Merro, M., Rathke, J.: Towards a behavioural theory of access and mobility control in distributed systems. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 282\u2013299. Springer, Heidelberg (2003)"},{"key":"99_CR18","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. TCS\u00a0152(2) (1995)","DOI":"10.1016\/0304-3975(95)00074-7"},{"key":"99_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/3-540-45061-0_47","volume-title":"Automata, Languages and Programming","author":"M. Merro","year":"2003","unstructured":"Merro, M., Zappa Nardelli, F.: Bisimulation proof methods for mobile ambients. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 584\u2013598. Springer, Heidelberg (2003)"},{"key":"99_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)"},{"key":"99_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-49059-0_18","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"U. Montanari","year":"1999","unstructured":"Montanari, U., Pistore, M.: Finite state verification for the asynchronous pi-calculus. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 255\u2013269. Springer, Heidelberg (1999)"},{"issue":"5","key":"99_CR22","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0960129503004043","volume":"13","author":"C. Palamidessi","year":"2003","unstructured":"Palamidessi, C.: Comparing the Expressive Power of the Synchronous and the Asynchronous \u03c0-calculi. Mathematical Structures in Computer Science\u00a013(5), 685\u2013719 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"99_CR23","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"issue":"1","key":"99_CR24","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/640128.604136","volume":"38","author":"A. Schmitt","year":"2003","unstructured":"Schmitt, A., Stefani, J.-B.: The m-calculus: a higher-order distributed process calculus. SIGPLAN Not.\u00a038(1), 50\u201361 (2003)","journal-title":"SIGPLAN Not."},{"key":"99_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BFb0055628","volume-title":"CONCUR \u201998 Concurrency Theory","author":"P. Sewell","year":"1998","unstructured":"Sewell, P.: From Rewrite Rules to Bisimulation Congruences. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 269\u2013284. Springer, Heidelberg (1998)"},{"key":"99_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-47959-7_1","volume-title":"Internet Programming Languages","author":"P. Sewell","year":"1999","unstructured":"Sewell, P., Wojciechowski, P., Pierce, B.: Location independence for mobile agents. In: Bal, H.E., Cardelli, L., Belkhouche, B. (eds.) ICCL-WS 1998. LNCS, vol.\u00a01686, p. 1. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_99","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T06:45:58Z","timestamp":1559285158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11523468_99","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}