|Bibliography||Wagner, Sebastian; Kopp, Oliver; Leymann, Frank: Towards Verification of Process Merge Patterns with Allenís Interval Algebra. |
In: Proceedings of the 4th Central-European Workshop on Services and their Composition (ZEUS 2012).
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
pp. 1-8, english.
Bamberg: CEUR Workshop Proceedings, March 16, 2012.
Article in Proceedings (Workshop Paper).
|CR-Schema||H.4.1 (Office Automation)|
Choreographies present how parties collaborate to achieve an agreed business objective. When companies are bought, their processes have to be in-sourced. Thereby, their part in a choreography has to be merged with the part of their acquiring business partner. Merging patterns may be applied to merge reoccurring activity combinations, such as send/receive. It has to be proven that each merge patterns keeps the relations of the original activities of the choreography. As a first step, we show by an example how the relations between activities may be expressed using the Allen calculus. We show for merging a synchronous message exchange, which relations have to be considered for validating an implementation of that merge.
|Full text and|
|PDF (313185 Bytes)|
|Department(s)||University of Stuttgart, Institute of Architecture of Application Systems|
|Entry date||February 21, 2012|