A practical data-flow verification scheme for business processes
作者：
Highlights：
• This paper has proposed a data-flow verification scheme for business processes.
• To deal with state-space explosion, our method reduces the high-level process model to parts required to verify a property, i.e., use the notion of relevance.
• We have derived relevance for data-flow constraints and have studied the efficiency of respective verification approaches.
• We propose an approach that uses an intermediate representation for processes with data, exemplarily applied to BPMN and OTX.
• Our evaluation has demonstrated that our approach even works nicely for processes of realistic size.
摘要
•This paper has proposed a data-flow verification scheme for business processes.•To deal with state-space explosion, our method reduces the high-level process model to parts required to verify a property, i.e., use the notion of relevance.•We have derived relevance for data-flow constraints and have studied the efficiency of respective verification approaches.•We propose an approach that uses an intermediate representation for processes with data, exemplarily applied to BPMN and OTX.•Our evaluation has demonstrated that our approach even works nicely for processes of realistic size.
论文关键词：Workflow management,Business process,Data-flow correctness,Property verification,State-space reduction for high-level languages
论文评审过程：Received 24 August 2018, Revised 27 November 2018, Accepted 17 December 2018, Available online 26 December 2018, Version of Record 2 January 2019.
论文官网地址：https://doi.org/10.1016/j.is.2018.12.002
