Efficient compliance checking using BPMN-Q and temporal logic

  • Awad A
  • Decker G
  • Weske M
  • 118

    Readers

    Mendeley users who have this article in their library.
  • 140

    Citations

    Citations of this article.

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 become a time-consuming task. Automated compliance checking of process activities and their ordering is an alternative whenever business processes 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 explosion we employ a set of reduction rules. The approach is prototypically realized and evaluated.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text

Authors

  • Ahmed Awad

  • Gero Decker

  • Mathias Weske

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free