Verifying compliance in process choreographies: Foundations, algorithms, and implementation

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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information systems (Oxford) Ročník 108; s. 101983
Hlavní autori: Fdhila, Walid, Knuplesch, David, Rinderle-Ma, Stefanie, Reichert, Manfred
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford Elsevier Ltd 01.09.2022
Elsevier Science Ltd
Predmet:
Algorithms
Business
Business process compliance
Business rules
Collaboration
Compliance
Compliance management
Decomposition
Distributed business processes
EU membership
Global compliance rules
Information systems
Organizational change
Pandemics
Process choreography
Property
Prototypes
Regulation
Rule decomposition
Specification
Supply
Supply chains
Transitivity
Valence
Verification
Visibility
Rule decomposition
Business rules
Distributed business processes
Compliance management
Business process compliance
Process choreography
Global compliance rules
ISSN:0306-4379, 1873-6076
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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. •Decomposition enables decentralized checking of global compliance rules.•Global compliance decomposition avoids trust in a central coordinator with knowledge on private tasks.•Global compliance decomposition improves privacy of partner private processes.•Global Compliance decomposition reduces compliance-related partner communication.•Proof-of-concept and practical applications.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0306-4379
1873-6076
DOI:10.1016/j.is.2022.101983