Algebraic Approach to Linking the Semantics of Web Services

Web services have become more and more important in these years, and BPEL4WS (BPEL) is a de facto standard for the Web service composition and orchestration. It contains several distinct features, including the scope-based compensation and fault handling mechanism. We have considered the operational semantics and denotational semantics for BPEL, where a set of algebraic laws can be achieved via these two models respectively. In this paper, we consider the inverse work, deriving the operational semantics and denotational semantics from algebraic semantics for BPEL. In our model, we introduce four types of typical programs, by which every program can be expressed as the summation of these four types. Based on the algebraic semantics, the strategy for deriving the operational semantics is provided and a transition system is derived by strict proof. This can be considered as the soundness exploration for the operational semantics based on the algebraic semantics. Further, the equivalence between the derivation strategy and the derived transition system is explored, which can be considered as the completeness of the operational semantics. Finally, the derivation of the denotational semantics from algebraic semantics is explored, which can support to reason about more program properties easily.

[1]  Michael J. Butler,et al.  An Operational Semantics for StAC, a Language for Modelling Long-Running Business Transactions , 2004, COORDINATION.

[2]  Stephen D. Brookes.  Full Abstraction for a Shared-Variable Parallel Language , 1996, Inf. Comput..

[3]  Shamim Ripon,et al.  Executable Semantics for Compensating CSP , 2005, EPEW/WS-FM.

[4]  Jifeng He,et al.  From Operational Semantics to Denotational Semantics for Verilog , 2001, CHARME.

[5]  Cosimo Laneve,et al.  web-pi at Work , 2005, TGC.

[6]  R. J. van Glabbeek,et al.  Comparative Concurrency Semantics and Refinement of Actions , 1996 .

[7]  Jing Li,et al.  Unifying Denotational Semantics with Operational Semantics for Web Services , 2007, ICDCIT.

[8]  Annabelle McIver,et al.  Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science) , 2004 .

[9]  Augusto Sampaio,et al.  Algebraic derivation of an operational semantics , 2000, Proof, Language, and Interaction.

[10]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

[11]  R. V. Glabbeek.  CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes , 2001 .

[12]  Sanjiva Weerawarana,et al.  The Business Process Execution Language for Web Services , 2005, Process-Aware Information Systems.

[13]  Paolo Milazzo,et al.  Design and verification of long-running transactions in a timed framework , 2008, Sci. Comput. Program..

[14]  Jim Davies.  Specification and proof in real-time CSP , 1993, Distinguished dissertations in computer science.

[15]  Michael J. Butler,et al.  A Process Compensation Language , 2000, IFM.

[16]  Franck van Breugel,et al.  Dead-path-elimination in BPEL4WS , 2005, Fifth International Conference on Application of Concurrency to System Design (ACSD'05).

[17]  Geguang Pu,et al.  Semantics of BPEL4WS-Like Fault and Compensation Handling , 2005, FM.

[18]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[19]  Franck van Breugel,et al.  Modelling and verifying web service orchestration by means of the concurrency workbench , 2004, SOEN.

[20]  Michael J. Butler,et al.  Precise Modelling of Compensating Business Transactions and its Application to BPEL , 2005, J. Univers. Comput. Sci..

[21]  Jean-Raymond Abrial,et al.  The B-book - assigning programs to meanings , 1996 .

[22]  Shengchao Qin,et al.  Verifying BPEL-Like Programs with Hoare Logic , 2008, TASE.

[23]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[24]  He Jifeng,et al.  Modelling Coordination and Compensation , 2008 .

[25]  Jifeng He,et al.  An Operational Approach to BPEL-like Programming , 2007 .

[26]  Jifeng He,et al.  Soundness, Completeness and Non-redundancy of Operational Semantics for Verilog Based on Denotational Semantics , 2002, ICFEM.

[27]  Jifeng He,et al.  Looking into Compensable Transactions , 2007 .

[28]  C. A. R. Hoare,et al.  A Trace Semantics for Long-Running Transactions , 2004, 25 Years Communicating Sequential Processes.

[29]  E. B. Moss,et al.  Nested Transactions: An Approach to Reliable Distributed Computing , 1985 .

[30]  Geguang Pu,et al.  Towards the Semantics and Verification of BPEL4WS , 2006, WLFM@FM.

[31]  C. A. R. Hoare,et al.  Laws of programming , 1987, CACM.

[32]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[33]  Jifeng He,et al.  From algebraic semantics to denotational semantics for Verilog , 2006 .

[34]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[35]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[36]  Roberto Bruni,et al.  Theoretical foundations for compensations in flow composition languages , 2005, POPL '05.

[37]  Manuel Mazzara,et al.  A pi-calculus based semantics for WS-BPEL , 2007, J. Log. Algebraic Methods Program..

[38]  C. A. R. Hoare,et al.  From Algebra to Operational Semantics , 1993, Inf. Process. Lett..

[39]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[40]  Jifeng He,et al.  A model for BPEL-like languages , 2007, Frontiers of Computer Science in China.

[41]  Roberto Bruni,et al.  From Theory to Practice in Transactional Composition of Web Services , 2005, EPEW/WS-FM.

[42]  Erik P. de Vink,et al.  Control flow semantics , 1996 .

[43]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.