Business process compliance is hard

In the present paper we analyze the complexity of a fragment of the compliance checking problem. Although the fragment studied leaves out many feature of the original problem, like compensations and non-structured processes, we prove that the complexity of such fragment is already NP-complete.