Abstract
Web service is increasingly being applied in solving many universal interoperability problems. Business Process Execution Language (BPEL) is a de facto standard for specifying the behavior of business processes. It contains several interesting features, including scope-based compensation, fault handling and shared-labels for synchronization. In this paper we explore an observation-oriented model for BPEL-like languages, which can be used to study program equivalence. The execution states of a program are divided into five types: completed state, waiting state and divergent state, as well as error state and undo state. The last two states are especially for dealing with compensation and fault handling. Based on the formalized model, a set of algebraic laws is investigated, including traditional laws and BPEL featured laws. The concept of guarded choice is also introduced in this model, which can be used to support the transformation of a parallel program into the form of guarded choice. Two special scopes are introduced: canonical structure and compensation structure, which are used to eliminate undo and compensation construct from finite processes.
Similar content being viewed by others
References
Thatte S. XLANG: Web Service for Business Process Design. Microsoft, 2001, http://www.gotdotnet.com/team/xml_wsspecs/xlangc/default.html
Leymann F. Web Services Flow Language (WSFL 1.0). IBM, 2001. http://www-3.ibm.com/software/solutions/webservices/pdf/WSDL.pdf
Curbera F, Goland Y, Klein J, et al. Business Process Execution Language for Web Service. 2003. http://www.siebel.com/bpel
Butler M J, Ferreira C. An Operational Semantics for StAC, a Language for Modelling Long-Running Business Transactions. In: Proc. COORDINATION 2004: Coordination Models and Languages, 6th International Conference on Coordination Models and Languages. Lecture Notes in Computer Science, Vol 2949. Berlin: Springer, 2004, 87–104.
Hoare C A R. Communicating Sequential Processes. Communication of the ACM, 1978, 21(8): 666–677
Roscoe A W. The Theory and Practice of Concurrency. Prentice Hall International Series in Computer Science. 1997
Butler M, Ripon S. Executable Semantics for Compensating CSP. In: Proc. EPEW 2005: International Workshop on Web Services and Formal Methods. Lecture Notes in Computer Science, Vol 3670. Berlin: Springer-Verlag, 2005, 243–256
Butler M J, Hoare C A R, Ferreira C. A Trace Semantics for Long-Running Transactions. Communicating Sequential Processes: The First 25 Years, Symposium on the Occasion of 25 Years of CSP. Lecture Notes in Computer Science, Vol. 3525. Berlin: Springer-Verlag, 2005, 133–150
Butler M J, Ferreira C. A Process Compensation Language. In: Proc. IFM 2000: 2nd International Conference on Integrated Formal Methods. Lecture Notes in Computer Science Vol 1945. Berlin: Springer-Verlag, 2000, 61–76
Abrial J R. The B-Book: Assigning Programs to Meanings. Cambridge: Cambridge University Press, 1996
Butler M J, Ferreira C, Ng M Y. Precise Modelling of Compensating Business Transactions and its Application to BPEL. Journal of Universal Computer Science. 2005, 11(5): 712–743
Bruni R, Melgratti H C, Montanari U. Theoretical foundations for compensations in flow composition languages. In: Proc. POPL 2005: 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM, 2004, 209–220
Bruni R, Ferrari G L, Melgratti H C, et al. From Theory to Practice in Transactional Composition of Web Services. In: Proc. EPEW/WS-FM 2005: European Performance Engineering Workshop and International Workshop on Web Services and Formal Methods. Lecture Notes in Computer Science. Vol 3670. Berlin: Springer-Verlag, 2005, 272–286
Qiu Z Y, Wang S L, Pu G G, et al. Semantics of BPEL4WS-Like Fault and Compensation Handling. In: Proc. FM 2005: International Symposium of Formal Methods Europe. Lecture Notes in Computer Science. Vol 3582. Berlin: Springer, 2005, 350–365
Pu G G, Zhu H B, Qiu Z Y, et al. Theoretical Foundations of Scope-based Compensation Flow Language for Web Service. Proc. FMOODS 2005: 8th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems. Lecture Notes in Computer Science. Vol 4307. Berlin: Springer-Verlag, 2006, 251–266
Cerone A, Zhao X P, Krishnan P. Modelling and Resource Allocation Planning of BPEL Workflows under Security Constraints. UNU/IIST Technical Report 336. 2006
WS-CDL. http://www.w3.org/TR/ws-cdl-10/
Montangero C, Semini L. A Logical View of Choreography. COORDINATION. In: Proc. COORDINATION 2006: 8th International Conference on Coordination Models and Languages. Vol 4038. Berlin: Springer-Verlag, 2006, 179–193
Li J, He J F, Pu G G. Towards the Semantics for Web Services Choreography Description Language. In: Proc. ICFEM 2006: 8th International Conference on Formal Engineering Methods. Lecture Notes in Computer Science. Vol 4260. Berlin: Springer-Verlag, 2006, 246–263
Yang H L, Zhao X P, Qiu Z Y, et al. Type Checking Choreography Description Language. In: Proc. ICFEM 2006: 8th International Conference on Formal Engineering Methods. Lecture Notes in Computer Science. Vol 4260. Berlin: Springer-Verlag, 2006
Yang H L, Zhao X P, Qiu Z Y, et al. Formal Model for Web Service Choreography Description Language (WS-CDL). In: Proc. ICWS 2006: The 2006 IEEE International Conference on Web Services. IEEE Computer Society Press, 2006, 893–894
Zhao X P, Yang H L, Qiu Z Y. Towards the Formal Model and Verification of Web Service Choreography Description Language. In: Proc. WS-FM 2006: 3rd International Workshop on Web Services and Formal Methods. Lecture Notes in Computer Science. Vol 4184. Berlin: Springer-Verlag, 2006, 273–284
Milner R. Communication and Mobile System: π-calculus. Cambridge University Press, 1999
Lucchi R, Mazzara M. A Pi-calculus based Semantics for WS-BPEL. Journal of Logic and Algebraic Programming (in press)
Laneve C, Zavattaro G. Web-pi at Work. In: Proc. TGC 2005: International Symposium on Trustworthy Global Computing. Lecture Notes in Computer Science. Vol 3705. Berlin: Springer-Verlag, 2005, 182–194
Bhargavan K, Fournet C, Gordon A D. A Semantics for Web Services Authentication. Theoretical Computer Science, 2005, 340(1): 102–153
Dolev D, Yao A C. On the security of public key protocols. IEEE Transactions on Information Theory, 1983, 29(2): 198–207
Gordon A D, Pucella R. Validating a Web Service Security Abstraction by Typing. Formal Aspects of Computing, 2005, 17(3): 277–318
Abadi M, Gordon AD. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 1999, 148(1): 1–70
Hoare C A R, He J F. Unifying Theories of Programming. Prentice Hall International Series in Computer Science, 1998
He J F. rovably Correct Systems: Modelling of Communication Languages and Design of Optimized Compilers. The McGraw-Hill International Series in Software Engineering, 1994
Pu G G, Zhao X P, Wang S L, et al. Towards the Semantics and Verification of BPEL4WS. Electronic Notes in Theoretical Computer Science, 2006, 151(2): 33–52
Holzmann G J. The Spin Model Checker-Primer and Reference manual. Addison-Wesley, 2003
Alonso G, Kuno H, Casati F, et al. Web Services: Concepts, Architectures and Applications. Berlin: Springer, 2003
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
He, J., Zhu, H. & Pu, G. A model for BPEL-like languages. Front. Comput. Sc. China 1, 9–19 (2007). https://doi.org/10.1007/s11704-007-0002-7
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11704-007-0002-7