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.
翻译:目前对互操作性的推动促使各公司通过流程编程进行合作。与此同时,它们面临着不断变化的监管条例(例如,由于这一大流行病和BREXIT等动态,这些动态对跨组织协作产生强烈的影响。例如,考虑跨越多个不同甚至甚至相互冲突的COVID19旅行限制的国家的供应链。因此,在流程编程中提供自动合规核查对于任何跨组织业务流程都至关重要。一个特别的挑战是,在全球合规规则(GCR)的存在,即跨越若干伙伴进程的规则,伙伴程序受到有限的可见度。这项工作涉及在受影响任务不完全可见的情况下如何核查全球遵守情况的问题。我们的想法是将GCRS分解成所谓的主张,每个受影响的伙伴都可以通过这种主张来检查分解的正确性和无损性。算法利用了基本规则规格的过渡性特性,其正确性和复杂性得到了证明,考虑到诸如循环等先进的方面。算法是在一个证据确凿的概念原型中执行的,包括一个用于进一步核查遵守情况的模型检查器。