Skip to Main content Skip to Navigation

Composition de services: algorithmes et complexité

Fahima Cheikh 1
1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
IRIT - Institut de recherche en informatique de Toulouse
Abstract : The problem of combining services, also called the services composition problem, constitutes the centre of intense research activity. To compose services consists of merging their action sequences in order to obtain new sequences that satisfy the client requirements. This problem is in general difficult to solve. In this thesis, we consider services that are able to perform two kinds of actions: communication actions and internal actions. Moreover, services are able to verify conditions before an action execution and to change the value of variables after an action execution. Formally, services are represented by conditional communicating automata. We define for this model the services composition problem and we study its decidability for the following preorder and equivalence relations: traces inclusion, trace equivalence, simulation and bisimulation. Further to the decidability results obtained we propose three variants of the initial model. For each variant we define the composition problem and we study its complexity regarding the relations cited above.
Document type :
Complete list of metadata
Contributor : Fahima Cheikh-Alili <>
Submitted on : Tuesday, February 23, 2010 - 11:25:51 AM
Last modification on : Thursday, March 18, 2021 - 2:24:58 PM
Long-term archiving on: : Friday, June 18, 2010 - 7:49:16 PM


  • HAL Id : tel-00459114, version 1


Fahima Cheikh. Composition de services: algorithmes et complexité. Autre [cs.OH]. Université Paul Sabatier - Toulouse III, 2009. Français. ⟨tel-00459114⟩



Record views


Files downloads