BeMatch: a platform for matchmaking service behavior models
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Detecting and Resolving Process Model Differences in the Absence of a Change Log
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Symbolic Abstraction and Deadlock-Freeness Verification of Inter-enterprise Processes
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Journal of Theoretical and Applied Electronic Commerce Research
A monitoring approach for runtime service discovery
Automated Software Engineering
Symbolic abstraction and deadlock-freeness verification of inter-enterprise processes
Data & Knowledge Engineering
Querying contract databases based on temporal behavior
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Ontology to represent similarity relations between public web services
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
Checking soundness of business processes compositionally using symbolic observation graphs
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Increasing recall of process model matching by improved activity label matching
BPM'13 Proceedings of the 11th international conference on Business Process Management
| Hi-index | 0.00 |
The capability to easily find useful services (software applications, software components, scientific computations) becomes increasingly critical in several fields. Current approaches for services retrieval are mostly limited to the matching of their inputs/outputs. Recent works have demonstrated that this approach is not sufficient to discover relevant components. In this paper we argue that, in many situations, the service discovery should be based on the specification of service behavior (in particular, the conversation protocol). The idea behind is to develop matching techniques that operate on behavior models and allow delivery of partial matches and evaluation of semantic distance between these matches and the user requirements. Consequently, even if a service satisfying exactly the user requirements does not exist, the most similar ones will be retrieved and proposed for reuse by extension or modification. To do so, we reduce the problem of behavioral matching to a graph matching problem and we adapt existing algorithms for this purpose. A prototype is presented (available as a web service) which takes as input two conversation protocols and evaluates the semantic distance between them; the prototype provides also the script of edit operations that can be used to alter the first model to render it identical with the second one.