In this paper, we present generic algorithms to ensure the consistency of mutual-exclusion and binding constraints in a business process context. We repeatedly identified the need for such generic algorithms in our real-world projects. Thus, the algorithms are a result of the experiences we gained in analyzing, designing, and implementing a number of corresponding software systems and tools. In particular, these algorithms check corresponding consistency requirements to prevent constraint conflicts and to ensure the design-time and runtime compliance of a process-related role-based access control (RBAC) model.
Strembeck et al. REF present a set of generic algorithms that ensure the consistency of entailment constraints.
Generic Algorithms for Consistency Checking of Mutual-Exclusion and Binding Constraints in a Business Process Context
OTM Conferences
Computer Science