Service querying to support process variant development
•Service querying helps to facilitate the development of process variants.•We provide a query language based on the similarity between services.•We compute the service similarity based on a concept of neighborhood context.•We specify the similarity between service connectors (AND, OR, XOR).•We devel...
Gespeichert in:
Veröffentlicht in: | The Journal of systems and software 2016-12, Vol.122, p.538-552 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | •Service querying helps to facilitate the development of process variants.•We provide a query language based on the similarity between services.•We compute the service similarity based on a concept of neighborhood context.•We specify the similarity between service connectors (AND, OR, XOR).•We developed a GUI application and performed several experiments on a real dataset.
Developing process variants enables enterprises to effectively adapt their business models to different markets. Existing approaches focus on business process models to support the variant development. The assignment of services in a business process, which ensures the process variability, has not been widely examined. In this paper, we present an innovative approach that focuses on component services instead of process models. We target to recommend services to a selected position in a business process. We define the service composition context as the relationships between a service and its neighbors. We compute the similarity between services based on the matching of their composition contexts. Then, we propose a query language that considers the composition context matching for service querying. We developed an application to demonstrate our approach and performed different experiments on a public dataset of real process models. Experimental results show that our approach is feasible and efficient. |
---|---|
ISSN: | 0164-1212 1873-1228 |
DOI: | 10.1016/j.jss.2015.07.050 |