Business Process Compliance is Hard

Download Now
Provided by: University of Luton
Topic: Big Data
Format: PDF
Even by considering a small fragment of the compliance checking problem, in this paper the authors prove that the complexity of the problem is NP-complete. Thus for instances of the compliance checking problem involving complex processes and or large sets of local obligation with a compensation associated, computing the solution can be infeasible due to the complexity of the problem. In this paper, they analyze the complexity of a fragment of the compliance checking problem.
Download Now

Find By Topic