{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:32:19Z","timestamp":1761597139712},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p>We investigate, in a process algebraic setting, a new notion of correctness for service compositions, which we call<jats:italic>strong service compliance<\/jats:italic>: composed services are strong compliant if their composition is both deadlock and livelock free (this is the traditional notion of compliance), and whenever a message can be sent to invoke a service, it is guranteed to be ready to serve the invocation. We also define a new notion of refinement, called<jats:italic>strong subcontract pre-order<\/jats:italic>, suitable for strong compliance: given a composition of strong compliant services, we can replace any service with any other service in subcontract relation while preserving the overall strong compliance. Finally, we present a characterisation of the strong subcontract pre-order by resorting to the theory of a (should) testing pre-order.<\/jats:p>","DOI":"10.1017\/s0960129509007658","type":"journal-article","created":{"date-parts":[[2009,5,8]],"date-time":"2009-05-08T08:18:19Z","timestamp":1241770699000},"page":"601-638","source":"Crossref","is-referenced-by-count":35,"title":["A theory of contracts for strong service compliance"],"prefix":"10.1017","volume":"19","author":[{"given":"MARIO","family":"BRAVETTI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GIANLUIGI","family":"ZAVATTARO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2009,6,1]]},"reference":[{"key":"S0960129509007658_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11596141_18"},{"key":"S0960129509007658_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"S0960129509007658_ref17","unstructured":"OASIS (2003) WS-BPEL: Web Services Business Process Execution Language Version 2.0. Technical report."},{"key":"S0960129509007658_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27813-9_19"},{"key":"S0960129509007658_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.06.002"},{"key":"S0960129509007658_ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328471"},{"key":"S0960129509007658_ref19","doi-asserted-by":"crossref","unstructured":"Weinberg D. (2008) Efficient Controllability Analysis of Open Nets. In: WS-FM'08. Springer-Verlag Lecture Notes in Computer Science (to appear).","DOI":"10.1007\/978-3-642-01364-5_14"},{"key":"S0960129509007658_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75698-9_14"},{"key":"S0960129509007658_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77351-1_4"},{"key":"S0960129509007658_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11767954_5"},{"key":"S0960129509007658_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71316-6_2"},{"key":"S0960129509007658_ref6","unstructured":"Carbone M. , Honda K. , Yoshida NSpringer-Verlag Lecture Notes in Computer Science , Milner R. , Brown G. and Ross-Talbot S. (2006) A Theoretical Basis of Communication-Centred Concurrent Programming. WCD-Working Note. Available at: http:\/\/www.dcs.qmul.ac.uk\/carbonem\/cdlpaper\/workingnote.pdf."},{"key":"S0960129509007658_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11841197_10"},{"key":"S0960129509007658_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44929-9_27"},{"key":"S0960129509007658_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74407-8_15"},{"key":"S0960129509007658_ref14","doi-asserted-by":"crossref","unstructured":"Lohmann N. (2008) Why does my service have no partners? In: WS-FM'08. Springer-Verlag Lecture Notes in Computer Science (to appear).","DOI":"10.1007\/978-3-642-01364-5_12"},{"key":"S0960129509007658_ref20","unstructured":"W3C (2004) WS-CDL: Web Services Choreography Description Language. Technical report, W3C."},{"key":"S0960129509007658_ref13","doi-asserted-by":"crossref","unstructured":"Leymann F. (2001) Web Services Flow Language (wsfl 1.0). Technical report, IBM Software Group.","DOI":"10.1007\/3-540-45752-6_1"},{"key":"S0960129509007658_ref15","unstructured":"Milner R. (1989) Communication and Concurrency, Prentice-Hall."},{"key":"S0960129509007658_ref18","unstructured":"Thatte S. (2001) XLANG: Web services for business process design. Technical report, Microsoft Corporation."}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129509007658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T02:58:44Z","timestamp":1633402724000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129509007658\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["S0960129509007658"],"URL":"https:\/\/doi.org\/10.1017\/s0960129509007658","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}