2010
DOI: 10.1109/tsc.2010.6
|View full text |Cite
|
Sign up to set email alerts
|

Ranking BPEL Processes for Service Discovery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
57
0
1

Year Published

2011
2011
2021
2021

Publication Types

Select...
7
2
1

Relationship

2
8

Authors

Journals

citations
Cited by 74 publications
(58 citation statements)
references
References 26 publications
0
57
0
1
Order By: Relevance
“…The first one takes into account parameters related with inputs/outputs and names of each task of BP [3,4]; the second one is focused on the semantic inference of related concepts contained in ontologies [5][6][7][8]; the third one, compares the BP structure usually represented trough modeling formalisms which ease the structural analysis using mathematical techniques, such as graph isomorphism [9][10][11][12]; and the last one, compares the behavior of BP represented as interchange of messages within tasks, record of historical execution of BP, and control-flow [13,14].…”
Section: Current Approaches For Bp Retrievalmentioning
confidence: 99%
“…The first one takes into account parameters related with inputs/outputs and names of each task of BP [3,4]; the second one is focused on the semantic inference of related concepts contained in ontologies [5][6][7][8]; the third one, compares the BP structure usually represented trough modeling formalisms which ease the structural analysis using mathematical techniques, such as graph isomorphism [9][10][11][12]; and the last one, compares the behavior of BP represented as interchange of messages within tasks, record of historical execution of BP, and control-flow [13,14].…”
Section: Current Approaches For Bp Retrievalmentioning
confidence: 99%
“…See Dijkman et al [58] for an overview. Some of these works assume that an ontology exists for matching the labels [59,60,61]. Also techniques for semantic annotation have been proposed [62,63,64,65].…”
Section: Related Workmentioning
confidence: 99%
“…Pairwise computation of the distance of process models allows comparing a given query with models from a process repository, and thus, to find similar models. They also need to be ranked [27]. However, traditional indexes cannot be applied as the notion of pairwise similarity does not yield any ordering of process models.There are two competing approaches to indexing process models: (1) indexing process model elements [28,29]; and (2) indexing complete process models, provided a similarity metric is used that satisfied the triangle inequality property [30].…”
Section: Process Model Search and Indexingmentioning
confidence: 99%