Intelligent web based on mathematic theory. Case study : service composition validation via distributed compiler and graph theory

This paper discusses a model for verifying service composition by building a distributed semi-compiler of service process. In this talk, we introduce a technique that solves the service composition problems such as infinite loops,deadlock and replicate use of the service. Specifically, the client needs to build a composite service by invoking other services but without knowing the exact design of these loosely coupled services. The proposed Distributed Global Service Compiler, by this article, results dynamically from the business process of each service. As a normal compiler cannot detect loops, we apply a graph theory algorithm, a Depth First Search, on the deduced result taken from business process files