Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-23T22:18:20.844Z Has data issue: false hasContentIssue false
  • English
  • Français

A theory of contracts for strong service compliance

Published online by Cambridge University Press:  01 June 2009

MARIO BRAVETTI  and
GIANLUIGI ZAVATTARO
MARIO BRAVETTI
Affiliation:
Department of Computer Science, Università di Bologna, Email: [email protected], [email protected]
GIANLUIGI ZAVATTARO
Affiliation:
Department of Computer Science, Università di Bologna, Email: [email protected], [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We investigate, in a process algebraic setting, a new notion of correctness for service compositions, which we call strong service compliance: 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 strong subcontract pre-order, 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.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 19 , Issue 3 , June 2009 , pp. 601 - 638
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bravetti, M. and Zavattaro, G. (2007a) Contract based Multi-party Service Composition. In: FSEN'07. Springer-Verlag Lecture Notes in Computer Science 4767 207–222.CrossRefGoogle Scholar
Bravetti, M. and Zavattaro, G. (2007b) Towards a Unifying Theory for Choreography Conformance and Contract Compliance. In: SC'07. Springer-Verlag Lecture Notes in Computer Science 4829 34–50.CrossRefGoogle Scholar
Busi, N., Gorrieri, R., Guidi, C., Lucchi, R. and Zavattaro, G. (2005) Choreography and orchestration: A synergic approach for system design. In: ICSOC'05. Springer-Verlag Lecture Notes in Computer Science 3826 228–240.CrossRefGoogle Scholar
Busi, N., Gorrieri, R., Guidi, C., Lucchi, R. and Zavattaro, G. (2006) Choreography and orchestration conformance for system design. In: Coordination'06. Springer-Verlag Lecture Notes in Computer Science 4038 63–81.CrossRefGoogle Scholar
Carbone, M., Honda, K. and Yoshida, N. (2007) Structured Communication-Centred Programming for Web Services. In: ESOP'07. Springer-Verlag Lecture Notes in Computer Science 4421 2–17.CrossRefGoogle Scholar
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.Google Scholar
Carpineti, S., Castagna, G., Laneve, C. and Padovani, L. (2006) A Formal Account of Contracts for Web Services. In: WS-FM'06. Springer-Verlag Lecture Notes in Computer Science 4184 148–162.CrossRefGoogle Scholar
Castagna, G., Gesbert, N. and Padovani, L. (2008) A Theory of Contracts for Web Services. In: POPL'08, ACM Press 261–272.CrossRefGoogle Scholar
De Nicola, R. and Hennessy, M. (1984) Testing Equivalences for Processes. Theoretical Computer Science 34 83–133.CrossRefGoogle Scholar
Fournet, C., Hoare, C. A. R., Rajamani, S. K. and Rehof, J. (2004) Stuck-Free Conformance. In: CAV'04. Springer-Verlag Lecture Notes in Computer Science 3114 242–254.CrossRefGoogle Scholar
Kobayashi, N. (2000) Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness. In: IFIP TCS'00. Springer-Verlag Lecture Notes in Computer Science 1872 365–389.CrossRefGoogle Scholar
Laneve, C. and Padovani, L. (2007) The must preorder revisited - An algebraic theory for web services contracts. In: Concur'07. Springer-Verlag Lecture Notes in Computer Science 4703 212–225.CrossRefGoogle Scholar
Leymann, F. (2001) Web Services Flow Language (wsfl 1.0). Technical report, IBM Software Group.CrossRefGoogle Scholar
Lohmann, N. (2008) Why does my service have no partners? In: WS-FM'08. Springer-Verlag Lecture Notes in Computer Science (to appear).CrossRefGoogle Scholar
Milner, R. (1989) Communication and Concurrency, Prentice-Hall.Google Scholar
Rensink, A. and Vogler, W. (2005) Fair testing. Information and Computation 205 125–198.CrossRefGoogle Scholar
OASIS (2003) WS-BPEL: Web Services Business Process Execution Language Version 2.0. Technical report.Google Scholar
Thatte, S. (2001) XLANG: Web services for business process design. Technical report, Microsoft Corporation.Google Scholar
Weinberg, D. (2008) Efficient Controllability Analysis of Open Nets. In: WS-FM'08. Springer-Verlag Lecture Notes in Computer Science (to appear).CrossRefGoogle Scholar
W3C (2004) WS-CDL: Web Services Choreography Description Language. Technical report, W3C.Google Scholar