Communicating sequential processes
Communicating sequential processes
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing two approaches to compensable flow composition
CONCUR 2005 - Concurrency Theory
A Framework for Generic Error Handling in Business Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards the Semantics and Verification of BPEL4WS
Electronic Notes in Theoretical Computer Science (ENTCS)
A feature-complete Petri net semantics for WS-BPEL 2.0
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
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
First-Order dynamic logic for compensable processes
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
One of the most challenging aspects in Web Service composition is guaranteeing transactional integrity. This is usually achieved by providing mechanisms for fault, compensation and termination (FCT) handling. WS-BPEL 2.0, the de-facto standard language for Business Process Orchestration provides powerful scope-based FCT-handling mechanisms. However, the lack of a formal semantics makes it difficult to understand and implement these constructs, and renders rigid analysis impossible. The general concept of compensating long-running business transactions has been studied in different formal theories, such as cCSP and Sagas, but none of them is specific to WS-BPEL 2.0. Other approaches aim at providing formal semantics for FCT-handling in WS-BPEL 2.0, but only concentrate on specific aspects. Therefore, they cannot be used for a comparative analysis of FCT-handling in WS-BPEL 2.0. In this paper we discuss the BPEL approach to FCT-handling in the light of recent research. We provide formal semantics for the WS-BPEL 2.0 FCT-handling mechanisms which aims at capturing the FCT-part of the WS-BPEL 2.0 specification in full detail. We then compare the WS-BPEL 2.0 approach to FCT-handling to existing formal theories.