A pi-calculus based semantics for WS-BPEL

@article{Lucchi2007APB,
  title={A pi-calculus based semantics for WS-BPEL},
  author={Roberto Lucchi and Manuel Mazzara},
  journal={J. Log. Algebraic Methods Program.},
  year={2007},
  volume={70},
  pages={96-118}
}
Towards a Unifying Theory for Web Services Composition
TLDR
This paper introduces webπ∞, an untimed version of webπ, and the related theory, as a foundational unifying framework for orchestration able to meet composition requirements and to encode the whole BPEL itself.
Using formal methods to develop WS-BPEL applications
Fault, Compensation and Termination in WS-BPEL 2.0 - A Comparative Analysis
TLDR
This paper provides formal semantics for the WS-BPEL 2.0 FCT-handling mechanisms which aims at capturing the F CT-part of the WS.BPEL2.0 specification in full detail, and compares the BPEL approach to FCT -handling to existing formal theories.
Issues about the Adoption of Formal Methods for Dependable Composition of Web Services
TLDR
The problem of composing services starting directly from the pi-calculus and considering the proposals as foundational models for composition simply to verify statements regarding any mathematical foundations of composition languages are addressed.
Model-checking Web Services Orchestrations using BP-calculus
Formal Specification of Correlation in WS Orchestrations Using BP-calculus
Toward a Pi-Calculus Based Verification Tool for Web Services Orchestrations
  • F. Abouzaid
  • Computer Science
    Computer Supported Acitivity Coordination
  • 2006
TLDR
The basis of a framework aimed to specification and verification, related to some temporal logic, of Web services composition is presented, using a πcalculus-based approach for the verification of composite Web services by applying model checking methods.
A Formal Semantics for the WS-BPEL Recovery Framework - The pi-Calculus Way
TLDR
In this work, 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.
Modeling and Verifying Web Services Choreography Using Process Algebra
TLDR
The semantics of WS-CDL is presented in terms of process algebra CSP which has great advantages in designing and verifying concurrent processes and all the properties the authors want to check within a WS- CDL document can be verified automatically in the CSP framework correspondingly.
A Survey of Web services Orchestration and Choreography with Formal Models
TLDR
This paper gives a formal methods focused survey of BPEL and WS-CDL languages and focuses on some BPEL orchestration aspects using formal models: error, event, and compensation handling using extended version of -calculus, correlation mechanisms using process algebra, and control ow constructs using Petri nets.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 118 REFERENCES
A Case Study of Web Services Orchestration
TLDR
This paper discusses webπ∞ an untimed subcalculus of webπ which is a simple and conservative extension of the π-calculus which is introduced as a theoretical and foundational model for Web Services coordination.
A Framework for Generic Error Handling in Business Processes
A Formal Framework for Web Services Coordination
Theoretical foundations for compensations in flow composition languages
TLDR
This paper presents a hierarchy of transactional calculi with increasing expressiveness, starting from a very small language in which activities can only be composed sequentially, and progressively introducing parallel composition, nesting, programmable compensations and exception handling.
Towards a Formal Foundation to Orchestration Languages
  • Mirko Viroli
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2004
The CORBA Activity Service Framework for Supporting Extended Transactions
TLDR
The framework described in this paper is an overview of the OMG’s Additional Structuring Mechanisms for the OTS standard now reaching completion and shows that the Framework has the flexibility to support a wide variety of extended transaction models.
A Calculus for Long-Running Transactions
TLDR
This paper designs an extension of the asynchronous π-calculus with long-running transactions (and sequences) – the πt -calculus, by defining a semantics and providing a correct encoding of ρt-Calculus into asynchronous ρ-cal calculus.
An Operational Semantics for StAC, a Language for Modelling Long-Running Business Transactions
TLDR
An operational semantics for the StAC language is presented and it is shown that StAC is similar to a process algebraic language such as Hoare's CSP or Milner's CCS but has additional operators dealing with compensation and with exception handling.
Web services transactions : past , present and future
TLDR
This paper tries to address some of the questions surrounding the release of three competing specifications in the past two years and gives an indication of where the market will go in the future.
Web Services Choreography Description Language Version 1.0, W3C
TLDR
The Web Services Choreography specification is targeted for composing interoperable, peer-to-peer collaborations between any type of party regardless of the supporting platform or programming model used by the implementation of the hosting environment.
...
1
2
3
4
5
...