The 2005 Symposium on Applications and the Internet
DOI: 10.1109/saint.2005.4
|View full text |Cite
|
Sign up to set email alerts
|

A Graph-Based Approach to Web Services Composition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
45
0
3

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 82 publications
(48 citation statements)
references
References 4 publications
0
45
0
3
Order By: Relevance
“…Various methods have been proposed for service discovery and composition. Graph-Based approach proposes a modeling language called interface automata as the low-level construct [6]. Two categories of service composition include syntactic and semantic composition.…”
Section: Service Compositionmentioning
confidence: 99%
“…Various methods have been proposed for service discovery and composition. Graph-Based approach proposes a modeling language called interface automata as the low-level construct [6]. Two categories of service composition include syntactic and semantic composition.…”
Section: Service Compositionmentioning
confidence: 99%
“…The refined meta-composition is no more a sub-network of N. It is still an interaction network, but with slightly modified meta-operations. Compared to the meta-composition as found at the previous step, while m 7 is removed from meta-operations, o 1 '' and o 6 ' are removed from the underlying operations of their respective meta-operations m 1 and m 6. Given the refined meta-composition resulting from the previous step, Procedure 2 is used to instantiate this refined meta-composition. As shown in Figure 3 …”
Section: Examplementioning
confidence: 99%
“…Composition search is done by SQL statements. In [6], a breadth first search algorithm is used to search for compositions in a semantic network of parameters. In [7], the information on link analysis of a semantic Web service interaction network is used to guide the A* shortest path search algorithm that probe the Web service space.…”
Section: Introductionmentioning
confidence: 99%
“…The execution sequence is represented as a dependency graph G = (V, E) as in [11]. The set V of nodes represents a component to be executed, while the edge E represents a pairwise execution dependency between two components.…”
Section: Execution Sequencementioning
confidence: 99%
“…We represent each component via an interface automaton, thus [11] Two interface automata P and Q are composable if their execution actions are disjoint, except that an input action of one may coincide with an output action of the other. Hence the necessary condition for two components to possess composition dependency, is that their respective interface automata be composable.…”
Section: Component Representationmentioning
confidence: 99%