Causes-based problems in business process compliance based management

Today, a trend in Business Process Management (BPM) research is the study of techniques and paradigms that can handle agility. Thus, trend is also to decompose complex business processes for different purposes such as reuse or understanding. However, the cross cutting essence of compliance rules is orthogonal to any traditional building `block' or hierarchical based decomposition of a business process. In this abstract, we address the problem of decomposition of business processes given a set of compliance rules. To summarize, we provide a sound categorization of contributing subformula occurrences in an artifact system A w.r.t to an LTL-FO formula. We give a complexity result for computing an explanation of compliance. Furthermore, one provided a method to extract all explanations. This method is built on the computation of all the high level minimal unsatisfiable subsets of constraints in a Satisfiability Modulo Theory problem using uninterpreted predicates (relational) except for the following one (N, <;).