{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:13:17Z","timestamp":1725574397901},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210443"},{"type":"electronic","value":"9783540246343"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24634-3_6","type":"book-chapter","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T22:57:55Z","timestamp":1294354675000},"page":"38-54","source":"Crossref","is-referenced-by-count":13,"title":["On Calculi for Context-Aware Coordination"],"prefix":"10.1007","author":[{"given":"Pietro","family":"Braione","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gian Pietro","family":"Picco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: The Chemical Abstract Machine. Theoretical Computer Science\u00a096, 217\u2013248 (1992)","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-46000-4_12","volume-title":"Coordination Models and Languages","author":"N. Busi","year":"2002","unstructured":"Busi, N., Rowstron, A., Zavattaro, G.: State- and event-based reactive programming in shared dataspaces. In: Arbab, F., Talcott, C. (eds.) COORDINATION 2002. LNCS, vol.\u00a02315, p. 111. Springer, Heidelberg (2002)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Cardelli","year":"1998","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 140\u2013155. Springer, Heidelberg (1998)"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"J.F. Groote","year":"1993","unstructured":"Groote, J.F.: Transition system specifications with negative premises. Theoretical Computer Science\u00a0118(2), 263\u2013299 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"Groote, J.F., Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Information and Computation\u00a0100(2), 202\u2013260 (1992)","journal-title":"Information and Computation"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J.J. Leifer","year":"2000","unstructured":"Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science\u00a096(1), 73\u2013155 (1992)","journal-title":"Theoretical Computer Science"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Murphy, A.L., Picco, G.P., Roman, G.-C.: Lime: A Middleware for Physical and Logical Mobility. In: Golshani, F., et al. (eds.) Proc. of the 21st Int. Conf. on Distributed Computing Systems (ICDCS-21), pp. 524\u2013533 (May 2001)","DOI":"10.1109\/ICDSC.2001.918983"},{"key":"6_CR9","first-page":"254","volume-title":"Coordination of Internet Agents: Models, Technologies, and Applications","author":"G.-C. Roman","year":"2000","unstructured":"Roman, G.-C., Murphy, A.L., Picco, G.P.: Coordination and Mobility. In: Omicini, A., et al. (eds.) Coordination of Internet Agents: Models, Technologies, and Applications, pp. 254\u2013273. Springer, Heidelberg (2000)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Sassone, V., Soboci\u0144ski, P.: Deriving Bisimulation Congruences: A 2- Categorical Approach. In: Nestmann, U., Panangaden, P. (eds.) Proc. of the 9th Int. Wksp. on Expressiveness in Concurrency (EXPRESS 2002). Electronic Notes in Theoretical Computer Science, vol.\u00a068. Springer, Heidelberg (2002)","DOI":"10.1016\/S1571-0661(05)80367-6"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24634-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T04:44:40Z","timestamp":1553316280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24634-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210443","9783540246343"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24634-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}