Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A Case Study in Developing Web Services for Capital Markets
EEE '04 Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
Translating unstructured workflow processes to readable BPEL: Theory and implementation
Information and Software Technology
A Calculus for Generation, Verification and Refinement of BPEL Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding process algebraic descriptions of web services into BPEL
Web Intelligence and Agent Systems
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
SOCK: a calculus for service oriented computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
A tool for rapid development of WS-BPEL applications
ACM SIGAPP Applied Computing Review
An evaluation of process mediation approaches in web services
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
Model checking adaptive multilevel service compositions
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
A Formal Approach for the Validation of Web Service Orchestrations
International Journal of Web Portals
| Hi-index | 0.00 |
The Business Process Execution Language for Web Services (BPEL) is the standard for implementing orchestrated business processes designed but not limited to, as web services. BPEL is a powerful language but lacks a widely accepted formal semantics, and this makes it difficult to formally validate the correct execution of BPEL implementations. In the other hand, process algebras have proved their efficiency in the specification of web services orchestrations. In this paper we improve the BP-calculus, a @p-calculus based formalism designed to ease the automatic generation of verified BPEL code, by defining specific equivalence and logic in order to verify BPEL implementations through their formal specification expressed in this calculus. The formal specification of service-oriented applications allows the checking of functional properties described by means of the new logic, that is shown to be well suited to capture peculiar aspects of services formalized in @p-like languages. As an illustrative example, we present the BP-calculus specification and the verification results of a trade market service scenario.