Abstract
In a service composition, it is necessary to ensure that the behaviour of a constituent service is consistent with the requirements of the composition. In an adaptive service composition those behavioural requirements may be continually changing. This paper shows how the behavioural requirements in abstract service definitions (roles) can be dynamically and incrementally defined using constraints. These constraints are then used to generate finite state automata, which are used to check the compatibility of candidate services that have their behaviour expressed in static interface descriptions such as OWL-S. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Colman, A., Pham, L. D., Han, J., & Schneider, J. G. (2008). Towards dynamic matching of business-level protocols in adaptive service compositions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4928 LNCS, pp. 502–507). https://doi.org/10.1007/978-3-540-78238-4_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
