A formal semantics for the Taverna 2 workflow model
Journal of Computer and System Sciences
A tool for rapid development of WS-BPEL applications
ACM SIGAPP Applied Computing Review
A formal semantics for the WS-BPEL recovery framework: the π-calculus way
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Core BPEL: syntactic simplification of WS-BPEL 2.0
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A pattern-based approach for the verification of business process descriptions
Information and Software Technology
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |
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.