Abstract
Toward a Formalization of BPEL 2.0 : An Algebra Approach
Highlights
Web services are a successful instantiation of SOC [1, 2, 3], they are used by a wide array of companies and governments because of their autonomy, reusability, flexibility, and platform-independence
Even if the global ideas of the fault handler and the compensation handler are intuitive, it remains that there are a large number of particular cases that need to be considered: Which fault handler catches which error? Which compensation handler needs to be called after a given error? Which activities need to be stopped when an error occurs? What happens if an error occurs during a compensation? What happens if an error occurs in a fault handler itself? These are only a part of the particular situations that need to be clarified
This paper provides a detailed formalization of the EFCT of BPEL, that address the above questions, through a process algebra endowed with a small step operational semantics
Summary
Web services are a successful instantiation of SOC [1, 2, 3], they are used by a wide array of companies and governments because of their autonomy, reusability, flexibility, and platform-independence. We focus on WS-BPEL 2.0, the dominant standard to express orchestration process, later called BPEL, for short It is a rich and expressive language that provides interesting features. This paper provides a detailed formalization of the EFCT of BPEL, that address the above questions, through a process algebra endowed with a small step operational semantics. It allows to remove its ambiguities, and to detect the incompleteness of its specification (behaviors that are not explicitly described by the specification) as it was stated in [16] It allows to detect the redundancy of some operators and gives the possibility to simplify the language by substituting a group of constructors or concepts with better new ones as advocated in [17].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have