Goal preservation by choreography-driven matchmaking

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this work we give a formal background and identify the limits of applicability of local matching criteria (among which the well-known Zaremski and Wings's plugin-match) when they are used to automatically retrieve all the capabilities that are necessary to instantiate a given choreography. In doing this it is necessary to take into account and somehow merge two possibly conflicting perspectives: the local criterion for selecting single capabilities and the overall goal that we mean the composition to pursue. Formally, the problem is interpreted as the study of the preservation of the global properties of a choreography, when its roles are played by specific services. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Baldoni, M., Baroglio, C., Martelli, A., Patti, V., & Schifanella, C. (2009). Goal preservation by choreography-driven matchmaking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4907 LNCS, pp. 413–426). https://doi.org/10.1007/978-3-540-93851-4_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free