USING PROCESS ALGEBRA FOR THE AUTOMATIC VERIFICATION OF COMPOSITE WEB SERVICES MODELED IN UML

للكاتبين :

Amal Algammal & Mohamed El-Sharkawi

Faculty of Computers and Information – Information Systems Department

Cairo University- Cairo – Egypt

ABSTRACT:

The last several years have seen a great interest in web services paradigm especially in ecommerce,

science and telecommunications contexts. The web services paradigm allows rich,

flexible, and dynamic interoperation of distributed and heterogeneous web-resident services. The

web services paradigm introduces a new generation of systems that have a mine of problems that

need to be solved. One of the most important problems related to the web services paradigm is

the composition of web services. Service composition raises many complex challenges such as

service description, selection and orchestration. Another important challenge is that after

performing a certain composition (either automatically or manually) there should be some

methods that can enable us to verify whether the new composite service actually conforms to user

needs, or detect that it fails to ensure some important properties. Here we propose to map web

services described by using UML as proposed by authors in [1] to process algebra (PA). More

specifically we use CSP (Communicating Sequential Processes) language. Consequently we can

exploit the advanced and sophisticated automated verification tools associated with CSP to meet

this challenge. We also propose a simple way using CSP in order to address the spawning issue in

service composition.

اترك تعليقاً

لن يتم نشر عنوان بريدك الإلكتروني. الحقول الإلزامية مشار إليها بـ *