Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Efficient Analysis of BPEL 2.0 Processes Using p-Calculus
APSCC '07 Proceedings of the The 2nd IEEE Asia-Pacific Service Computing Conference
Dynamic Recovering of Long Running Transactions
Trustworthy Global Computing
Fault, Compensation and Termination in WS-BPEL 2.0 -- A Comparative Analysis
Web Services and Formal Methods
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A case study of web services orchestration
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Towards a unifying theory for web services composition
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
A tool for rapid development of WS-BPEL applications
ACM SIGAPP Applied Computing Review
A WSDL-based type system for asynchronous WS-BPEL processes
Formal Methods in System Design
Toward design, modelling and analysis of dynamic workflow reconfigurations
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
An operational semantics of BPEL orchestrations integrating web services resource framework
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
While current studies on Web services composition are mostly focused -- from the technical viewpoint -- on standards and protocols, this work investigates the adoption of formal methods for dependable composition. The Web Services Business Process Execution Language (WS-BPEL) -- an OASIS standard widely adopted both in academic and industrial environments -- is considered as a touchstone for concrete composition languages and an analysis of its ambiguous Recovery Framework specification is offered. In order to show the use of formal methods, a precise and unambiguous description of its (simplified) mechanisms is provided by means of a conservative extension of the π-calculus. This has to be intended as a well known case study providing methodological arguments for the adoption of formal methods in software specification. The aspect of verification is not the main topic of the paper but some hints are given.