Formal Specification of Correlation in WS Orchestrations Using BP-calculus

  • Authors:
  • Faisal Abouzaid;John Mullins

  • Affiliations:
  • CRAC Lab., Computer & Software Eng. Dept., ÉÉcole Polytechnique de Montréal. P.O. Box 6079, Station Centre-ville, Montreal (Quebec), Canada, H3C 3P8;CRAC Lab., Computer & Software Eng. Dept., ÉÉcole Polytechnique de Montréal. P.O. Box 6079, Station Centre-ville, Montreal (Quebec), Canada, H3C 3P8

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Correlation is an important mechanism used in orchestration languages for Web Services. It expresses means by which many instances of the same service can be carried on at the same time. In this paper we extend the BP-calculus, a language based on the @p-calculus and dedicated to the specification of web service orchestrations, with a message algebra, a mechanism of function evaluation and a mechanism of correlation. The mechanism of function evaluation allows message handling while the mechanism of correlation guarantees uniqueness of service instances by preventing reception of messages inducing the same assignments of a correlation set. We also show how it can be used to express the semantics of the BPEL constructs coping with correlation. As an illustration of the usefulness of this process algebraic framework, we terminate with the presentation of a motivating example, the Trade Market example.