An Incremental Graph-based Approach to Automatic Service Composition

Shiaa, Mazen Malek; Fladmark, Jan Ove; Thiell, B.

doi:10.1109/scc.2008.141

Cited by 42 publications

(24 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Saifipoor et al [37] developed a service composition framework based on Reo coordination language to allow the primitive services and their coordination processes to be known explicitly only until run time. Also, Riabov et al [41] and Shiaa et al [45] built service composition platforms to allow users to incrementally refine their goals when creating composite services.…”

Section: B Service Designmentioning

confidence: 99%

“…Other platforms, such as WSMX [49], COLQUIDE [50], SCE [7], SCENE [57], Synthy IDE [32], and the graph-based service composition platform proposed by Shiaa et al [45], also allow users to define detailed specifications of their composite services, and help users to check the states of their services against the predefined rules.…”

Section: ) Checking Against Design Specification Another Approach Tmentioning

confidence: 99%

See 1 more Smart Citation

Supporting End-User Service Composition: A Systematic Review of Current Activities and Tools

Hang

Zhao

2015

2015 IEEE International Conference on Web Services

View full text Add to dashboard Cite

Abstract-This paper presents a systematic literature review of end-user service composition. It reviews current activities performed by end users, and tools and approaches that enable them to compose and develop service systems from Web Services. The paper also highlights some key open research issues for the future.Keywords -Systematic literature review, end user, end-user service composition, end-user development, end-user programming, end-user computing, service composition platform.

show abstract

Section: B Service Designmentioning

confidence: 99%

Section: ) Checking Against Design Specification Another Approach Tmentioning

confidence: 99%

Supporting End-User Service Composition: A Systematic Review of Current Activities and Tools

Hang

Zhao

2015

2015 IEEE International Conference on Web Services

View full text Add to dashboard Cite

show abstract

“…In this section, a brief analysis of some approaches is presented. Shiaa et al (2008) present an approach to automatic service composition with semantic matching. Given a request (goals, inputs and outputs), a set of matching services are discovered from the repository, applying semantic matching between service properties and the composition request.…”

Section: Related Workmentioning

confidence: 99%

An Optimal and Complete Algorithm for Automatic Web Service Composition

Lama

Rodríguez-Mier

Mucientes

et al. 2012

International Journal of Web Services Research

View full text Add to dashboard Cite

The ability of web services to build and integrate loosely-coupled systems has attracted a great deal of attention from researchers in the field of the automatic web service composition. The combination of different web services to build complex systems can be carried out using different control structures to coordinate the execution flow and, therefore, finding the optimal combination of web services represents a non-trivial search effort. Furthermore, the time restrictions together with the growing number of available services complicate further the composition problem. In this paper the authors present an optimal and complete algorithm which finds all valid compositions from the point of view of the semantic input-output message structure matching. Given a request, a service dependency graph which represents a suboptimal solution is dynamically generated. Then, the solution is improved using a backward heuristic search based on the A* algorithm which finds all the possible solutions with different number of services and runpath. Moreover, in order to improve the scalability of our approach, a set of dynamic optimization techniques have been included. The proposal has been validated using eight different repositories from the Web Service Challenge 2008, obtaining all optimal solutions with minimal overhead. . He has authored or coauthored more than 50 papers in international journals, book chapters, and conferences. His current research interests are evolutionary algorithms, genetic fuzzy systems, motion planning, and control in robotics, visual SLAM (Simultaneous Localization and Mapping), web services and process mining. Juan C. Vidal was born in Lausanne, Switzerland, in 1975. He received the BEng degree in computer science from the University of La Coruña, Spain, in 2000, worked as senior consultant for an IT firm several years, and received his PhD degree from the University of Santiago de Compostela, Spain, 2010. His research interests include knowledge discovery, semantic annotation, semantic modeling of workflows and services, and the use of artificial intelligence for business intelligence. Manuel Lama is associate professor in the Department of Electronics and Computer Science at the University of Santiago de Compostela. He received his PhD in computer science from the University of Santiago de Compostela in 2000. His research interests focuses on discovery and composition of web services, semantic annotation, and process mining. 2 Note that these values are only indicative. Smaller values have been found by our algorithm and by other participants. 3The speedup is calculated as the division of the non-optimized result by the optimized result. Thus, a speedup of 2.0x indicates that the optimized result is two times faster than the non-optimized one.

show abstract

“…[18,19]. In general, that work is targeted more toward workfloworiented applications (e.g., the processing steps involved in fulfilling a purchase order), rather than applications coordinating data obtained from multiple web services, as addressed in this paper.…”

Section: Related Workmentioning

confidence: 99%

Optimizing DaaS Web Service Based Data Mashups

Barhamgi¹,

Ghédira²,

Benslimane³

et al. 2011

2011 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

Data Mashup is a special class of mashup application that combines information on the fly from multiple data sources to respond to transient business needs. In this paper, we propose two optimization algorithms to optimize Data Mashups. The first allows for selecting the minimum number of services required in the data mashup. The second exploits the services' constraints on inputs and outputs to filter out superfluous calls to component services in the data mashup. These two algorithms are evaluated and tested in the healthcare application domain, and the reported results are very promising.

show abstract

An Incremental Graph-based Approach to Automatic Service Composition

Cited by 42 publications

References 2 publications

Supporting End-User Service Composition: A Systematic Review of Current Activities and Tools

Supporting End-User Service Composition: A Systematic Review of Current Activities and Tools

An Optimal and Complete Algorithm for Automatic Web Service Composition

Optimizing DaaS Web Service Based Data Mashups

Contact Info

Product

Resources

About