Compensable programs

Transaction-based services are increasingly being applied in solving many universal interoperability problems. Compensation is one typical feature for long-running transactions. This paper presents a design matrix model for specifying the behaviour of compensable programs and provides new healthiness conditions to capture these new programming features. The new model for handling exception and compensation is built as conservative extension of the standard relational model in the sense that the algebraic laws presented in [14] remain valid. The paper also shows that the design matrix model is a retract of the design model.

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

[2]  Ian J. Hayes,et al.  FM 2005: Formal Methods, International Symposium of Formal Methods Europe, Newcastle, UK, July 18-22, 2005, Proceedings , 2005, FM.

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

[4]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

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

[6]  Jing Li,et al.  Towards the Semantics for Web Service Choreography Description Language , 2006, ICFEM.

[7]  Joseph M. Morris,et al.  Non-Deterministic Expressions and Predicate Transformers , 1997, Inf. Process. Lett..

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

[9]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

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

[11]  Frank Leymann.  Web Services and Their Composition , 2001, EWSPT.

[12]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[13]  Mario Bravetti,et al.  Formal Techniques for Computer Systems and Business Processes, European Performance Engineering Workshop, EPEW 2005 and International Workshop on Web Services and Formal Methods, WS-FM 2005, Versailles, France, September 1-3, 2005, Proceedings , 2005, EPEW/WS-FM.

[14]  Gustavo Alonso,et al.  Web Services: Concepts, Architectures and Applications , 2009 .

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

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

[17]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[18]  Martín Abadi,et al.  A Calculus for Cryptographic Protocols: The spi Calculus , 1999, Inf. Comput..

[19]  Ajitha Rajan,et al.  Requirements Coverage as an Adequacy Measure for Conformance Testing , 2008, ICFEM.

[20]  Jifeng He,et al.  Theoretical Foundations of Scope-Based Compensable Flow Language for Web Service , 2006, FMOODS.

[21]  Matjaz B. Juric,et al.  Business process execution language for web services , 2004 .

[22]  Andrew D. Gordon,et al.  A semantics for web services authentication , 2005, Theor. Comput. Sci..

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

[24]  Andrew D. Gordon,et al.  Validating a web service security abstraction by typing , 2002, XMLSEC '02.

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

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

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