Timed Specification For Web Services Compatibility Analysis Web services are becoming one of the main technologies for designing and building complex interenterprise business applications. Usually, a business application cannot be fulfilled by one Web service but by coordinating a set of them. In particular, to perform a coordination, one of the important investigations is the compatibility analysis. Two Web services are said compatible if they can interact correctly. In the literature, the proposed frameworks for the services compatibility checking rely on the supported sequences of messages. The interaction of services depends also on other properties, such that the exchanged data flow. Thus, considering only supported sequences of messages seems to be insufficient. Other properties on which the services interaction can rely on, are the temporal constraints. In this paper, we focus our interest on the compatibility analysis of Web services regarding their (1) supported sequences of messages, (2) the exchanged data flow, (3) constraints related to the exchanged data flow and (4) the temporal requirements. Based on these properties, we study three compatibility classes: (i) absolute compatibility, (ii) likely compatibility and (iii) absolute incompatibility.

Formal Approach for Compatibility Checking of Orchestrations of Composite Semantic Web Services Web service composition is the process of combining Web services in order to offer valueadded services that meet the increasing complex requirements of business processes. Besides simple Web services described with WSDL, OWLS language allows to describe composite semantic Web services offering multiple operations using complex control structures. However, it becomes harder to manually check the consistency of orchestrations of such services in order to guarantee their correctness and avoid deadlock and erroneous statuses. In this paper, we first propose a formal method for translating OWLS composite services into communicating automata using an iterative process which is driven by the control structure of that language. The same approach is also applied to the orchestrator whose description is given in WSBPEL. Thereafter, we build up the synchronization product of the resulting automata and proceed to its consistency checking in order to unveil any forbidden statuses which depict flaws in that orchestration interaction protocol.