The service-oriented paradigm is rapidly emerging as the key approach to develop distributed business applications. Its enactment requires the ability to automatically coordinate existing services to realize novel and powerful desired functionalities, and planning-based solutions have proved to be strong candidates for this hard task. However, no current approach can satisfactorily coordinate stateful services that evolve continuously and indefinitely in an asynchronous way, such as e.g. notification services made increasingly available by business entities. This severely limits the practical applicability of current solutions. In this paper, we provide for the first time a full-fledged planning-based solution to the problem of continuously orchestrating stateful asynchronous services. To do so, we adopt a simple yet expressive requirement language, and we devise a novel planning algorithm that solves preference-ordered maintenability goals in the presence of exogenous events. Our approach is correct and complete, and our tests on a symbolic BDD-based implementation witness its ability and effectiveness in dealing with significant and realistic scenarios which no other current approach can tackle. Copyright © 2009, Association for the Advancement of Artificial Intelligence. All rights reserved.
CITATION STYLE
Bertoli, P., Kazhamiakin, R., Paolucci, M., Pistore, M., Raik, H., & Wagner, M. (2009). Continuous orchestration of web services via planning. In ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling (pp. 18–25). https://doi.org/10.1609/icaps.v19i1.13361
Mendeley helps you to discover research relevant for your work.