SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Database transaction models for advanced applications
Database transaction models for advanced applications
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Testing BPEL-based Web Service Composition Using High-level Petri Nets
EDOC '06 Proceedings of the 10th IEEE International Enterprise Distributed Object Computing Conference
The transaction concept: virtues and limitations (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Formalizing WSBPEL Business Processes Using Process Algebra
Electronic Notes in Theoretical Computer Science (ENTCS)
International Journal of Automation and Computing
IC cloud: Enabling compositional cloud
International Journal of Automation and Computing
Semantics of BPEL4WS-Like fault and compensation handling
FM'05 Proceedings of the 2005 international conference on Formal Methods
Transforming BPEL to petri nets
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Compensation in the world of web services composition
SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
Hi-index | 0.00 |
With regard to the failure and cancellation of business logic of web services composition (WSC), this paper propose a novel web services transaction compensation mechanism based on paired net which can dynamically establish agile compensation-triggered process (CSCP-Nets), and satisfy prospective compensation requirements. The related execution semantics of five usual composition compensation patterns based on paired net are analyzed in the situations of successful execution, failure compensation and failure recovery. Paired net based application of trip reservation process (TRP) shows that it is feasible.