Deriving consistent GSM schemas from DCR graphs

Rik Eshuis, Søren Debois*, Tijs Slaats, Thomas Hildebrandt

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

7 Citations (Scopus)

Abstract

Case Management (CM) is a BPM technology for supporting flexible services orchestration. CM approaches like CMMN, an OMG standard, and GSM, one of CMMN’s core influences, use Event- Condition-Action rules, which can be inconsistent due to cyclic interdependencies between the rules; repairing such an inconsistent case management schema is difficult. To avoid the problem of inconsistencies altogether, we provide a technique for automatically deriving consistent GSM case management schemas from higher-level business policies defined as DCR graphs, an alternative CM approach. Concretely, we define a behaviour-preserving mapping that (1) removes the burden from the modeller of GSM schemas to prove consistency and define the ordering of rules, (2) provides high-level patterns for modelling GSM schemas, and (3) gives a way to define a notion of progress (liveness) and acceptance for GSM instances. The mapping is illustrated by a running example of a mortgage loan application; and a prototype implementation available at http://dcr.itu.dk/icsoc16.

Original languageEnglish
Title of host publicationService-oriented computing : 14th International Conference, ICSOC 2016, Banff, AB, Canada, October 10-13, 2016, Proceedings
EditorsQuan Z. Sheng, Eleni Stroulia, Samir Tata, Sami Bhiri
Number of pages16
PublisherSpringer
Publication date2016
Pages467-482
ISBN (Print)978-3-319-46294-3
ISBN (Electronic)978-3-319-46295-0
DOIs
Publication statusPublished - 2016
Event14th International Conference on Service-Oriented Computing - Banff, Canada
Duration: 10 Oct 201613 Oct 2016
Conference number: 14

Conference

Conference14th International Conference on Service-Oriented Computing
Number14
Country/TerritoryCanada
CityBanff
Period10/10/201613/10/2016
SeriesLecture notes in computer science
Volume9936
ISSN0302-9743

Cite this