Advertisement

Abstract

Transaction-based services are increasingly being applied in solving many universal interoperability problems. Exception and failure are the typical phenomena of the execution of long-running transactions. To accommodate these new program features, we extend the Guarded Command Language [10] by addition of compensation and coordination combinators, and enrich the standard design model [15] with new healthiness conditions. This paper shows that such an extension is conservative one because it preserves the algebraic laws for designs, which can be used to reduce all programs to a normal form algebraically. We also explore a Galois link between the standard design model with our new model, and show that the embedding from the former to the latter is actually a homomorphism.

Keywords

Normal Form Sequential Composition Modelling Coordination Left Zero Nondeterministic Choice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation 148(1), 1–70 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Alonso, G., Kuno, H., Casati, F., et al.: Web Services: Concepts, Architectures and Applications. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  3. 3.
    Bhargavan, K., et al.: A Semantics for Web Service Authentication. Theoretical Computer Science 340(1), 102–153 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bruni, R., Montanari, H.C., Montannari, U.: Theoretical foundation for compensation in flow composition languages. In: Proc. POPL 2005, 32nd ACM SIGPLAN-SIGACT symposium on principles of programming languages, pp. 209–220. ACM, New York (2004)Google Scholar
  5. 5.
    Bruni, R., et al.: From Theory to Practice in Transactional Composition of Web Services. In: Bravetti, M., Kloul, L., Zavattaro, G. (eds.) EPEW/WS-EM 2005. LNCS, vol. 3670, pp. 272–286. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Bulter, M.J., Ferreria, C.: A process compensation language. In: Grieskamp, W., Santen, T., Stoddart, B. (eds.) IFM 2000. LNCS, vol. 1945, pp. 61–76. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  7. 7.
    Bulter, M.J., Ferreria, C.: An Operational Semantics for StAC: a Lanuage for Modelling Long-Running Business Transactions. LNCS, vol. 2949, pp. 87–104. Springer, Heidelberg (2004)Google Scholar
  8. 8.
    Butler, M.J., Hoare, C.A.R., Ferreria, C.: A Trace Semantics for Long-Running Transactions. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. LNCS, vol. 3525, pp. 133–150. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Curbera, F., Goland, Y., Klein, J., et al.: Business Process Execution Language for Web Service (2003), http://www.siebei.com/bpel
  10. 10.
    Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Englewood Cliffs (1976)zbMATHGoogle Scholar
  11. 11.
    Gordon, A.D., et al.: Validating a Web Service Security Abstraction by Typing. Formal Aspects of Computing 17(3), 277–318 (2005)CrossRefzbMATHGoogle Scholar
  12. 12.
    Jifeng, H., Huibiao, Z., Geguang, P.: A model for BPEL-like languages. Frontiers of Computer Science in China 1(1), 9–20 (2007)CrossRefGoogle Scholar
  13. 13.
    Jifeng, H.: Compensable Programs. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) Formal Methods and Hybrid Real-Time Systems. LNCS, vol. 4700, pp. 349–364. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  14. 14.
    Hoare, C.A.R.: Communicating Sequential Language. Prentice Hall, Englewood Cliffs (1985)zbMATHGoogle Scholar
  15. 15.
    Hoare, C.A.R., Jifeng, H.: Unifying theories of programming. Prentice Hall, Englewood Cliffs (1998)zbMATHGoogle Scholar
  16. 16.
    Leymann, F.: Web Service Flow Language (WSFL1.0). IBM (2001)Google Scholar
  17. 17.
    Laneve, C., et al.: Web-pi at work. In: De Nicola, R., Sangiorgi, D. (eds.) TGC 2005. LNCS, vol. 3705, pp. 182–194. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  18. 18.
    Jing, L., Jifeng, H., Geguang, P.: Towards the Semantics for Web Services Choreography Description Language. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 246–263. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  19. 19.
    Lucchi, R., Mazzara, M.: A Pi-calculus based semantics for WS-BPEL. Journal of Logic and Algebraic Programming (in press)Google Scholar
  20. 20.
    Milner, R.: Communication and Mobile System: the π-calculus. Cambridge University Press, Cambridge (1999)Google Scholar
  21. 21.
    Morris, J.M.: Non-deterministic expressions and predicate transformers. Information Processing Letters 61, 241–246 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Geguang, P., et al.: Theoretical Foundation of Scope-based Compensation Flow Language for Web Service. LNCS, vol. 4307, pp. 251–266. Springer, Heidelberg (2006)Google Scholar
  23. 23.
    Qiu, Z.Y., et al.: Semantics of BPEL4WS-Like Fault and Compensation Handling. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol. 3582, pp. 350–365. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  24. 24.
    Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Thatte, S.: XLANG: Web Service for Business Process Design. Microsoft (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • He Jifeng
    • 1
  1. 1.Shanghai Key Laboratory of Trustworthy ComputingEast China Normal UniversityChina

Personalised recommendations