Automated Composition of E-Services with Lookahead

This paper aims at developing techniques towards automated design of composite e-services. We consider a framework of representing e-services as activity-based finite state automata design and study the following problem. For a given set of atomic e-services and a desired e-service, does there exist a "mediator" which delegates activities in the desired e-service to other 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 future activities. In this paper, we extend the decidability result by Berardi et al to the general case and study the amount of "lookahead" needed for delegators.