Notations for the Specification and Verification of Composite Web Services

  1. Lookup NU author(s)
  2. Dr Simon Woodman
  3. Douglas Palmer
  4. Emeritus Professor Santosh Shrivastava
  5. Dr Stuart Wheater
Author(s)Woodman SJ, Palmer DJ, Shrivastava SK, Wheater SM
Publication type Conference Proceedings (inc. Abstract)
Conference Name8th IEEE International Enterprise Distributed Object Computing Conference (EDOC)
Conference LocationMonterey, California
Year of Conference2004
Legacy Date20-24 September 2004
Full text is available for this publication:
Availability of a wide variety of Web services over the Internet offers opportunities of providing new value added services built by composing them out of existing ones. Service composition poses a number of challenges. A composite service can be very complex in structure, containing many temporal and data-flow dependencies between their constituent services. Furthermore, each individual service is likely to have its own sequencing constraints over its operations. It is highly desirable therefore to be able to validate that a given composite service is well formed: proving that it will not deadlock or livelock and that it respects the sequencing constraints of the constituent services. With this aim in mind, the paper proposes simple extensions to web service definition language (WSDL) enabling the order in which the exposed operations should be invoked to be specified. In addition, the paper proposes a composition language for defining the structure of a composite service. Both languages have an XML notation and a formal basis in the pi-calculus (a calculus for concurrent systems). The paper presents the main features of these languages, and shows how it is possible to validate a composite service by applying the pi-calculus reaction rules.
ActionsLink to this publication
Library holdingsSearch Newcastle University Library for this item