Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-3203
Authors: Dadashov, Elkhan
Title: Choreography-based business process consolidation in one-to-many interactions
Issue Date: 2013
metadata.ubs.publikation.typ: Abschlussarbeit (Master)
URI: http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-88473
http://elib.uni-stuttgart.de/handle/11682/3220
http://dx.doi.org/10.18419/opus-3203
Abstract: In different real world scenarios the big companies can acquire other companies, or the company can insource some of its own organizational units residing abroad to increase security and control on those units, also achieve minimization of transaction costs. In these scenarios business processes of partner companies need to be consolidated with each other. Interaction of the business processes of partner companies can be modeled by choreographies. The related works contain an approach for consolidation of the business processes which are represented in choreography with only one instance per process type. In other words, the related works only contain consolidation solution for one-to-one interaction scenarios. However, this thesis presents a concept for choreography based business process consolidation in one-to-many interaction scenarios, where one process interacts with multiple instances of another process. In particular, the number of involved instances is unknown at design time, and it only becomes known at run time of choreography. Flight ticket booking choreography is used as a motivation scenario, where it is assumed that number of involved airlines is not known in advance. On the whole, the process consolidation approach is extended for supporting consolidation of multi-instance partner processes into one merged process.
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
MSTR_3574.pdf2,06 MBAdobe PDFView/Open


Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.