Reasoning on Formalizing WS-CDL Mobility Using Process Algebra

With a good understanding of mobility mechanisms of WS-CDL, we can easily design applications that acquire, during the execution, all the information they need to invoke services. One of the means to ensure good interoperability between Web services is to formalize their mobility characteristics. Process algebras, such as π-calculus can be used to formalize Web Services characteristics and ensure that they satisfy some conditions required in SOA. The notion of mobility in process calculi refers to the fact that a process is able to exchange names as values. The core of π-calculus is based on interaction, using channel names as data, and the ability to generate fresh and unique names. This paper provides the basis for reasoning on formalizing mobility characteristics of Web services choreography using the process algebra π-calculus which is, according to Robin Milner, a model of concurrent computation based on the notion of naming. Formalizing mobility helps us to understand the nature of mobility, to reason about the behavior of mobile systems, and to develop model checking tools that are used to verify system correctness.