Composition of Services with Constraints

Philippe Balbiani (1, 2) , Fahima Cheikh Alili (1) , Pierre-Cyrille Héam (3) , Olga Kouchnarenko (4)

1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
2 CNRS - Centre National de la Recherche Scientifique
3 FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174)
4 CASSIS - Combination of approaches to the security of infinite states systems

Composition of Web services consists of the interleaving of the sequence of actions executed by the elementary services in accordance with a client specification. We model Web services as automata executing actions and also sending and receiving messages. This paper provides a theoretical study for three service composition problems, and in particular for the problem of computing a Boolean formula which exactly characterises the conditions required for services to answer the client s request. New complexity results are established for these problems within the framework of service composition with constraints.

Mots clés: Decidability

Domaines: Génie logiciel [cs.SE]

Philippe Balbiani, Fahima Cheikh Alili, Pierre-Cyrille Héam, Olga Kouchnarenko. Composition of Services with Constraints. 6th International Conference on Formal Aspects of Component Software (FACS 2009), Nov 2009, Eindhoven, Netherlands. pp.31-46, ⟨10.1016/j.entcs.2010.05.003⟩. ⟨hal-00560496⟩