Non-desynchronizable Service Choreographies

  • Authors:
  • Gero Decker;Alistair Barros;Frank Michael Kraft;Niels Lohmann

  • Affiliations:
  • Hasso-Plattner-Institute, University of Potsdam, Germany;SAP Research Centre, Brisbane, Australia;SAP AG, Walldorf, Germany;Institut für Informatik, Universität Rostock, Rostock, Germany 18051

  • Venue:
  • ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.02

Visualization

Abstract

A precise definition of interaction behavior between services is a prerequisite for successful business-to-business integration. Service choreographies provide a view on message exchanges and their ordering constraints from a global perspective. Assuming message sending and receiving as one atomic step allows to reduce the modelers' effort. As downside, problematic race conditions resulting in deadlocks might appear when realizing the choreography using services that exchange messages asynchronously. This paper presents typical issues when desynchronizing service choreographies. Solutions from practice are discussed and a formal approach based on Petri nets is introduced for identifying desynchronizable choreographies.