Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition | Zendy

Philippe Balbiani | Zendy; Fahima Cheikh | Zendy; Guillaume Feuillade | Zendy

Open Access

Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition

Author(s) -

Philippe Balbiani,

Fahima Cheikh,

Guillaume Feuillade

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2009.06.036

Subject(s) - web service , computer science , business process execution language , orchestration , composition (language) , ws policy , web modeling , ws addressing , automaton , service composition , services computing , software , world wide web , theoretical computer science , algorithm , web development , programming language , web mapping , web application security , art , musical , linguistics , philosophy , visual arts

Composition of services is necessary for realizing complex tasks on the Web. It has been characterized either as a plan synthesis problem or as a software synthesis problem: given a goal and a set of Web services, generate a composition of the Web services that satisfies the goal. We propose algorithms for performing automated Web service composition. We also examine the composition of services from the perspective of computational complexity

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research