Efficient semantics-based compliance checking using LTL formulae and unfolding
type: Item
instance of: scholarly article
title: Efficient semantics-based compliance checking using LTL formulae and unfolding
zbMATH Open document ID: 1311.68089
DOI: 10.1155/2013/962765
author: Liang Song
author: Lijie Wen
author: Hui Kong
author: Jianmin Wang
published in: Journal of Applied Mathematics
publication date: 2013-09-09T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 90B70
zbMATH DE Number: 6206888
describes a project that uses: BPEL2oWFN
MaRDI profile type: Publication
Wikidata QID: Q59007201
full work available at URL: https://doi.org/10.1155/2013/962765
OpenAlex ID: W2114689332
cites work: A technique of state space search based on unfolding
cites work: An improvement of McMillan's unfolding algorithm
cites work: Q3851636
cites work: Branching processes of Petri nets
cites work: Formal semantics and analysis of control flow in WS-BPEL
description: scientific article; zbMATH DE number 6206888