Synthesis of orchestrators from service choreographies

  • Authors:

  • Stephen McIlvenna;Marlon Dumas;Moe Thandar Wynn

  • Affiliations:

  • Queensland University of Technology, Brisbane, Queensland, Australia;University of Tartu, Estonia and Queensland University of Technology, Brisbane, Queensland, Australia;Queensland University of Technology, Brisbane, Queensland, Australia

  • Venue:
  • APCCM '09 Proceedings of the Sixth Asia-Pacific Conference on Conceptual Modeling - Volume 96
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Interaction topologies in service-oriented systems are usually classified into two styles: choreographies and orchestrations. In a choreography, services interact in a peer-to-peer manner and no service plays a privileged role. In contrast, interactions in an orchestration occur between one particular service, the orchestrator, and a number of subordinated services. Each of these topologies has its trade-offs. This paper considers the problem of migrating a service-oriented system from a choreography style to an orchestration style. Specifically, the paper presents a tool chain for synthesising orchestrators from choreographies. Choreographies are initially represented as communicating state machines. Based on this representation, an algorithm is presented that synthesises the behaviour of an orchestrator, which is also represented as a state machine. Concurrent regions are then identified in the synthesised state machine to obtain a more compact representation in the form of a Petri net. Finally, it is shown how the resulting Petri nets can be transformed into notations supported by commercial tools, such as the Business Process Modelling Notation (BPMN).