The e-services paradigm promises to enable rich, flexible, and dynamic inter-operation of highly distributed, heterogeneous networkenabled services. Among the challenges, a fundamental question concerns the design and analysis of composite e-services. This paper proposes techniques towards automated design of composite e-services. We consider the Roman model which represents eservices as activity-based finite state automata. For a given set of existing e-services and a desired e-service, does there exist a “mediator” which delegates activities in the desired e-service to existing e-services? The question was raised in an early study by Berardi et. al. for a restricted subclass of delegators which does not take into consideration of future activities. In this paper, we define a more general class of delegators called ”lookahead” delegators and we show that the hierarchy based on the amount of lookahead is strict. We, then, study the complexity of constructing such delegators...
Cagdas Evren Gerede, Richard Hull, Oscar H. Ibarra