Deriving consistent GSM schemas from DCR graphs

Rik Eshuis; Søren Debois; Tijs Slaats; Thomas Hildebrandt

doi:10.1007/978-3-319-46295-0_29

Deriving consistent GSM schemas from DCR graphs

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

^*Corresponding author for this work

Department of Computer Science

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 language	English
Title of host publication	Service-oriented computing : 14th International Conference, ICSOC 2016, Banff, AB, Canada, October 10-13, 2016, Proceedings
Editors	Quan Z. Sheng, Eleni Stroulia, Samir Tata, Sami Bhiri
Number of pages	16
Publisher	Springer
Publication date	2016
Pages	467-482
ISBN (Print)	978-3-319-46294-3
ISBN (Electronic)	978-3-319-46295-0
DOIs	https://doi.org/10.1007/978-3-319-46295-0_29
Publication status	Published - 2016
Event	14th International Conference on Service-Oriented Computing - Banff, Canada Duration: 10 Oct 2016 → 13 Oct 2016 Conference number: 14

Conference

Conference	14th International Conference on Service-Oriented Computing
Number	14
Country/Territory	Canada
City	Banff
Period	10/10/2016 → 13/10/2016

Series	Lecture notes in computer science
Volume	9936
ISSN	0302-9743

Access to Document

10.1007/978-3-319-46295-0_29

Cite this

Eshuis, R., Debois, S., Slaats, T., & Hildebrandt, T. (2016). Deriving consistent GSM schemas from DCR graphs. In Q. Z. Sheng, E. Stroulia, S. Tata, & S. Bhiri (Eds.), Service-oriented computing: 14th International Conference, ICSOC 2016, Banff, AB, Canada, October 10-13, 2016, Proceedings (pp. 467-482). Springer. Lecture notes in computer science Vol. 9936 https://doi.org/10.1007/978-3-319-46295-0_29

Deriving consistent GSM schemas from DCR graphs. / Eshuis, Rik; Debois, Søren; Slaats, Tijs et al.

Service-oriented computing: 14th International Conference, ICSOC 2016, Banff, AB, Canada, October 10-13, 2016, Proceedings. ed. / Quan Z. Sheng; Eleni Stroulia; Samir Tata; Sami Bhiri. Springer, 2016. p. 467-482 (Lecture notes in computer science, Vol. 9936).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Eshuis, R, Debois, S, Slaats, T & Hildebrandt, T 2016, Deriving consistent GSM schemas from DCR graphs. in QZ Sheng, E Stroulia, S Tata & S Bhiri (eds), Service-oriented computing: 14th International Conference, ICSOC 2016, Banff, AB, Canada, October 10-13, 2016, Proceedings. Springer, Lecture notes in computer science, vol. 9936, pp. 467-482, 14th International Conference on Service-Oriented Computing, Banff, Canada, 10/10/2016. https://doi.org/10.1007/978-3-319-46295-0_29

Eshuis R, Debois S, Slaats T, Hildebrandt T. Deriving consistent GSM schemas from DCR graphs. In Sheng QZ, Stroulia E, Tata S, Bhiri S, editors, Service-oriented computing: 14th International Conference, ICSOC 2016, Banff, AB, Canada, October 10-13, 2016, Proceedings. Springer. 2016. p. 467-482. (Lecture notes in computer science, Vol. 9936). doi: 10.1007/978-3-319-46295-0_29

Eshuis, Rik ; Debois, Søren ; Slaats, Tijs et al. / Deriving consistent GSM schemas from DCR graphs. Service-oriented computing: 14th International Conference, ICSOC 2016, Banff, AB, Canada, October 10-13, 2016, Proceedings. editor / Quan Z. Sheng ; Eleni Stroulia ; Samir Tata ; Sami Bhiri. Springer, 2016. pp. 467-482 (Lecture notes in computer science, Vol. 9936).

@inproceedings{ecbf19b174904716af46ec84a796e4af,

title = "Deriving consistent GSM schemas from DCR graphs",

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{\textquoteright}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.",

author = "Rik Eshuis and S{\o}ren Debois and Tijs Slaats and Thomas Hildebrandt",

year = "2016",

doi = "10.1007/978-3-319-46295-0_29",

language = "English",

isbn = "978-3-319-46294-3",

series = "Lecture notes in computer science",

publisher = "Springer",

pages = "467--482",

editor = "Sheng, {Quan Z.} and Eleni Stroulia and Samir Tata and Sami Bhiri",

booktitle = "Service-oriented computing",

note = "14th International Conference on Service-Oriented Computing, ICSOC 2016 ; Conference date: 10-10-2016 Through 13-10-2016",

}

TY - GEN

T1 - Deriving consistent GSM schemas from DCR graphs

AU - Eshuis, Rik

AU - Debois, Søren

AU - Slaats, Tijs

AU - Hildebrandt, Thomas

N1 - Conference code: 14

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-319-46295-0_29

DO - 10.1007/978-3-319-46295-0_29

M3 - Article in proceedings

AN - SCOPUS:84989298051

SN - 978-3-319-46294-3

T3 - Lecture notes in computer science

SP - 467

EP - 482

BT - Service-oriented computing

A2 - Sheng, Quan Z.

A2 - Stroulia, Eleni

A2 - Tata, Samir

A2 - Bhiri, Sami

PB - Springer

T2 - 14th International Conference on Service-Oriented Computing

Y2 - 10 October 2016 through 13 October 2016

ER -

Deriving consistent GSM schemas from DCR graphs

Abstract

Conference

Access to Document

Fingerprint

Cite this