Sciweavers

132 search results - page 4 / 27
» Scalable Web Service Composition with Partial Matches
Sort
View
FOSSACS
2007
Springer
14 years 1 months ago
A Lower Bound on Web Services Composition
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
Anca Muscholl, Igor Walukiewicz
WWW
2008
ACM
14 years 8 months ago
Circular context-based semantic matching to identify web service composition
This paper provides initial analysis in identifying possible Web services composition using context-based semantic matching. Context-based semantic matching allows service composi...
Aviv Segev
ENTCS
2006
175views more  ENTCS 2006»
13 years 7 months ago
A Semantical Framework for the Orchestration and Choreography of Web Services
Web Services are software services that can be advertised by providers and invoked by customers using Web technologies. This concept is currently carried further to address the co...
Claus Pahl, Yaoling Zhu
PDP
2010
IEEE
14 years 2 months ago
Trusted Interaction Patterns in Large-scale Enterprise Service Networks
Abstract—The evolution towards cross-organizational collaboration and interaction patterns has led to the emergence of scalable, Web services-based composition infrastructures. T...
Florian Skopik, Daniel Schall, Schahram Dustdar
VLDB
2003
ACM
160views Database» more  VLDB 2003»
14 years 7 months ago
Composing Web services on the Semantic Web
Service composition is gaining momentum as the potential silver bullet for the envisioned Semantic Web. It purports to take the Web to unexplored efficiencies and provide a flexibl...
Brahim Medjahed, Athman Bouguettaya, Ahmed K. Elma...