Efficient semantics-based compliance checking using LTL formulae and unfolding
Summary: Business process models are required to be in line with frequently changing regulations, policies, and environments. In the field of intelligent modeling, organisations concern automated business process compliance checking as the manual verification is a time-consuming and inefficient work. There exist two key issues for business process compliance checking. One is the definition of a business process retrieval language that can be employed to capture the compliance rules, the other concerns efficient evaluation of these rules. Traditional syntax-based retrieval approaches cannot deal with various important requirements of compliance checking in practice. Although a retrieval language that is based on semantics can overcome the drawback of syntax-based ones, it suffers from the well-known state space explosion. In this paper, we define a semantics-based process model query language through simplifying a property specification pattern system without affecting its expressiveness. We use this language to capture semantics-based compliance rules and constraints. We also propose a feasible approach in such a way that the compliance checking will not suffer from the state space explosion as much as possible. A tool is implemented to evaluate the efficiency. An experiment conducted on three model collections illustrates that our technology is very efficient.
- Business process compliance using reference models of law
- Efficient full compliance checking of concurrent components for business process models
- Formal verification of complex business processes based on high-level Petri nets
- Business process verification with constraint temporal answer set programming
- Computational complexity of compliance and conformance: drawing a line between theory and practice
This page was built for publication: Efficient semantics-based compliance checking using LTL formulae and unfolding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364600)
