TY - JOUR
T1 - Verifying compliance in process choreographies
T2 - Foundations, algorithms, and implementation
AU - Fdhila, Walid
AU - Knuplesch, David
AU - Rinderle-Ma, Stefanie
AU - Reichert, Manfred
N1 - Publisher Copyright:
© 2022 The Author(s)
PY - 2022/9
Y1 - 2022/9
N2 - The current push towards interoperability drives companies to collaborate through process choreographies. At the same time, they face a jungle of continuously changing regulations, e.g., due to the pandemic and developments such as the BREXIT, which strongly affect cross-organizational collaborations. Think of, for example, supply chains spanning several countries with different and maybe even conflicting COVID19 traveling restrictions. Hence, providing automatic compliance verification in process choreographies is crucial for any cross-organizational business process. A particular challenge concerns the restricted visibility of the partner processes at the presence of global compliance rules (GCR), i.e., rules that span across the process of several partners. This work deals with the question how to verify global compliance if affected tasks are not fully visible. Our idea is to decompose GCRs into so called assertions that can be checked by each affected partner whereby the decomposition is both correct and lossless. The algorithm exploits transitivity properties of the underlying rule specification, and its correctness and complexity are proven, considering advanced aspects such as loops. The algorithm is implemented in a proof-of-concept prototype, including a model checker for verifying compliance. The applicability of the approach is further demonstrated on a real-world manufacturing use case.
AB - The current push towards interoperability drives companies to collaborate through process choreographies. At the same time, they face a jungle of continuously changing regulations, e.g., due to the pandemic and developments such as the BREXIT, which strongly affect cross-organizational collaborations. Think of, for example, supply chains spanning several countries with different and maybe even conflicting COVID19 traveling restrictions. Hence, providing automatic compliance verification in process choreographies is crucial for any cross-organizational business process. A particular challenge concerns the restricted visibility of the partner processes at the presence of global compliance rules (GCR), i.e., rules that span across the process of several partners. This work deals with the question how to verify global compliance if affected tasks are not fully visible. Our idea is to decompose GCRs into so called assertions that can be checked by each affected partner whereby the decomposition is both correct and lossless. The algorithm exploits transitivity properties of the underlying rule specification, and its correctness and complexity are proven, considering advanced aspects such as loops. The algorithm is implemented in a proof-of-concept prototype, including a model checker for verifying compliance. The applicability of the approach is further demonstrated on a real-world manufacturing use case.
KW - Business process compliance
KW - Business rules
KW - Compliance management
KW - Distributed business processes
KW - Global compliance rules
KW - Process choreography
KW - Rule decomposition
UR - http://www.scopus.com/inward/record.url?scp=85123349152&partnerID=8YFLogxK
U2 - 10.1016/j.is.2022.101983
DO - 10.1016/j.is.2022.101983
M3 - Article
AN - SCOPUS:85123349152
SN - 0306-4379
VL - 108
JO - Information Systems
JF - Information Systems
M1 - 101983
ER -