Generic algorithms for consistency checking of mutual-exclusion and binding constraints in a business process context

32Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag 2010.

Cite

CITATION STYLE

APA

Strembeck, M., & Mendling, J. (2010). Generic algorithms for consistency checking of mutual-exclusion and binding constraints in a business process context. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6426 LNCS, pp. 204–221). https://doi.org/10.1007/978-3-642-16934-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free