Efficient Compliance Checking Using BPMN-Q and Temporal Logic

Abstract. Compliance rules describe regulations, policies and quality constraints business processes must adhere to. Given the large number of rules and their frequency of change, manual compliance checking can be-come a time-consuming task. Automated compliance checking of process activities and their ordering is an alternative whenever business pro-cesses and compliance rules are described in a formal way. This paper introduces an approach for automated compliance checking. Compliance rules are translated into temporal logic formulae that serve as input to model checkers which in turn verify whether a process model satisfies the requested compliance rule. To address the problem of state-space explo-sion we employ a set of reduction rules. The approach is prototypically realized and evaluated.