{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:38:43Z","timestamp":1743122323638,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642204005"},{"type":"electronic","value":"9783642204012"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20401-2_13","type":"book-chapter","created":{"date-parts":[[2011,9,7]],"date-time":"2011-09-07T10:53:38Z","timestamp":1315392818000},"page":"282-301","source":"Crossref","is-referenced-by-count":2,"title":["Advanced Mechanisms for Service Composition, Query and Discovery"],"prefix":"10.1007","author":[{"given":"Michele","family":"Boreale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Bravetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-75698-9_20","volume-title":"International Symposium on Fundamentals of Software Engineering","author":"L. Acciai","year":"2007","unstructured":"Acciai, L., Boreale, M.: Type abstractions of name-passing processes. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol.\u00a04767, pp. 302\u2013317. Springer, Heidelberg (2007)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-85361-9_30","volume-title":"CONCUR 2008 - Concurrency Theory","author":"L. Acciai","year":"2008","unstructured":"Acciai, L., Boreale, M.: Spatial and Behavioral Types in the Pi-Calculus. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 372\u2013386. Springer, Heidelberg (2008)"},{"issue":"4","key":"13_CR3","first-page":"451","volume":"89","author":"M. Bravetti","year":"2008","unstructured":"Bravetti, M., Zavattaro, G.: A Foundational Theory of Contracts for Multi-party Service Composition. Fundamenta Informaticae\u00a089(4), 451\u2013478 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-01918-0_7","volume-title":"Formal Methods for Web Services","author":"M. Bravetti","year":"2009","unstructured":"Bravetti, M., Zavattaro, G.: Contract-Based Discovery and Composition of Web Services. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol.\u00a05569, pp. 261\u2013295. Springer, Heidelberg (2009)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-77351-1_4","volume-title":"Software Composition","author":"M. Bravetti","year":"2007","unstructured":"Bravetti, M., Zavattaro, G.: Towards a Unifying Theory for Choreography Conformance and Contract Compliance. In: Lumpe, M., Vanderperren, W. (eds.) SC 2007. LNCS, vol.\u00a04829, pp. 34\u201350. Springer, Heidelberg (2007), http:\/\/www.cs.unibo.it\/~bravetti\/html\/techreports.html"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11841197_10","volume-title":"Web Services and Formal Methods","author":"S. Carpineti","year":"2006","unstructured":"Carpineti, S., Castagna, G., Laneve, C., Padovani, L.: A Formal Account of Contracts for Web Services. In: Bravetti, M., N\u00fa\u00f1ez, M., Tennenholtz, M. (eds.) WS-FM 2006. LNCS, vol.\u00a04184, pp. 148\u2013162. Springer, Heidelberg (2006)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"CONCUR 1993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation equivalence is decidable for basic parallel processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 143\u2013157. Springer, Heidelberg (1993)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing Equivalences for Processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"13_CR9","unstructured":"Esparza, J.: More Infinite Results. In: Current trends in Theoretical Computer Science: entering the 21st century, pp. 480\u2013503 (2001)"},{"key":"13_CR10","first-page":"372","volume-title":"Proc. of POPL 1996","author":"C. Fournet","year":"1996","unstructured":"Fournet, C., Gouthier, G.: The Reflexive Chemical Abstract Machine and the Join Calculus. In: Proc. of POPL 1996, pp. 372\u2013385. ACM Press, New York (1996)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-540-27813-9_19","volume-title":"Computer Aided Verification","author":"C. Fournet","year":"2004","unstructured":"Fournet, C., Hoare, C.A.R., Rajamani, S.K., Rehof, J.: Stuck-Free Conformance. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 242\u2013254. Springer, Heidelberg (2004)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","volume":"81","author":"R. Milner","year":"1989","unstructured":"Milner, R.: A complete axiomatization for observational congruence of finite-state behaviours. Information and Computation\u00a081, 227\u2013247 (1989)","journal-title":"Information and Computation"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-60915-6_4","volume-title":"Logics for Concurrency","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Moller, F.: Decidability Results in Automata and Process theory. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 102\u2013148. Springer, Heidelberg (1996)"},{"key":"#cr-split#-13_CR14.1","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Kobayashi, N.: A Generic Type System for the Pi-Calculus. In: Proc. of POPL, pp. 128\u2013141. ACM Press, New York (2001);","DOI":"10.1145\/360204.360215"},{"key":"#cr-split#-13_CR14.2","doi-asserted-by":"crossref","unstructured":"Full version appeared in Theoretical Computer Science\u00a0311(1-3), 121\u2013163 (2004)","DOI":"10.1016\/S0304-3975(03)00325-6"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11609773_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"N. Kobayashi","year":"2006","unstructured":"Kobayashi, N., Suenaga, K., Wischik, L.: Resource Usage Analysis for the Pi-Calculus. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 298\u2013312. Springer, Heidelberg (2006)"},{"key":"13_CR16","unstructured":"OASIS. Web Services Business Process Execution Language Version 2.0"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ic.2006.06.002","volume":"205","author":"A. Rensink","year":"2007","unstructured":"Rensink, A., Vogler, W.: Fair testing. Information and Computation\u00a0205(2), 125\u2013198 (2007)","journal-title":"Information and Computation"},{"key":"#cr-split#-13_CR18.1","unstructured":"Sangiorgi, D.: The name discipline of uniform receptiveness. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256. Springer, Heidelberg (1997);"},{"key":"#cr-split#-13_CR18.2","doi-asserted-by":"crossref","unstructured":"Theoretical Computer Science \u00a0221(1-2), 457\u2013493 (1999)","DOI":"10.1016\/S0304-3975(99)00040-7"},{"issue":"2-3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"Stirling, C.: Modal Logics for Communicating Systems. Theoretical Computer Science\u00a049(2-3), 311\u2013347 (1987)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Rigorous Software Engineering for Service-Oriented Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20401-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:51:14Z","timestamp":1560552674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20401-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642204005","9783642204012"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20401-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}