The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) (2007)
Tsukuba Science City, Japan
Dec. 11, 2007 to Dec. 14, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/APSCC.2007.36
The Business Process Execution Language (BPEL) has become the de-facto standard for the description of Web Service compositions. A variety of formal approaches to de- cide compatibility and consistency for BPEL processes has been presented. Nevertheless, these approaches suffer from high complexity and state explosion. Therefore we present a lean formalization of BPEL 2.0 based on the -calculus, that enables efficient reasoning. Due to our focus on be- havioral compatibility and consistency checking (and not on comprehensive formalization), we are able to reduce ef- fort needed for process verification. Besides the exemplary application of our approach, we also compare it to existing BPEL formalizations by means of complexity.
M. Weidlich, M. Weske and G. Decker, "Efficient Analysis of BPEL 2.0 Processes Using p-Calculus," The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)(APSCC), Tsukuba Science City, Japan, 2007, pp. 266-274.