A New Method to Model and Analyze the WS-BPEL Process under the Dead-Path-Elimination Semantics
Most of existing formal models for BPEL based Web Services composition are without description of deadpath-elimination semantics. There are Petri net based models describing the dead-path-elimination semantics, while the models are too big to handle large scale processes. In this paper, a new model called DPE net is advanced to describe the WS-BPEl process under the dead-path-elimination semantics. We give the DPE net models describing the basic control flow, relatively complete links semantics and deadpath-elimination semantics, and introduce how to analyze properties of the WS-BPEL process based on DPE Reachability Graph. The features of DPE net make the DPE net model for the WS-BPEL process smaller than the model based on P/T net. Moreover, the DPe Reachability Graph allows several transitions to be fired in one step, which reduces the reachability graphs size dramatically.
Chunxiang Xu Hanpin Wang Wanling Qu Meixia Zhu Yu Huang
Key laboratory of High Confidence Software Technologies, Ministry of Education Institute of Software Key laboratory of High Confidence Software Technologies, Ministry of Education Institute of Software Key laboratory of High Confidence Software Technologies, Ministry of Education Institute of Software
国际会议
上海
英文
203-211
2009-07-08（万方平台首次上网日期，不代表论文的发表时间）