V. Tsetsos, C. Anagnostopoulos, S. Hadjiefthymiades
{"title":"On the Evaluation of Semantic Web Service Matchmaking Systems","authors":"V. Tsetsos, C. Anagnostopoulos, S. Hadjiefthymiades","doi":"10.1109/ECOWS.2006.28","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.28","url":null,"abstract":"Semantic Web services are generally considered as the evolution of conventional Web services. Semantic information included in the service descriptions enables the development of advanced matchmaking schemes, capable of assigning degrees of match to the discovered services. In this paper, we address issues related to the evaluation of the retrieval effectiveness of semantic matchmaking systems. Our main position is that conventional evaluation schemes do not fully capture the added value of service semantics nor do they take into account the assigned degrees of match, supported by the majority of discovery engines. Through some preliminary experiments, we show that a generalization of the evaluation process based on fuzzy set theory techniques can lead to more accurate and meaningful evaluation results","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127523310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Transactions Concurrency Control in Web Service Environment","authors":"Mohammad Alrifai, Peter Dolog, W. Nejdl","doi":"10.1109/ECOWS.2006.37","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.37","url":null,"abstract":"Business transactions in Web service environments run with relaxed isolation and atomicity property. In such environments, transactions can commit and roll back independently on each other. Transaction management has to reflect this issue and address the problems which result for example from concurrent access to Web service resources and data. In this paper we propose an extension to the WS-transaction protocol which ensures the consistency of the data when independent business transactions access the data concurrently under the relaxed transaction properties. Our extension is based on transaction dependency graphs maintained at the service provider side. We have implemented such a protocol on top of WS-transaction. The extension on the Web service provider side is simple to achieve as it can be an integral part of the service invocation mechanism. It has also an advantage from an engineering point of view as it does not change the way consumers or clients of Web services have to be programmed. Furthermore, it avoids direct communication between transaction coordinators which preserves security by keeping the information about business transactions restricted to the coordinators which are responsible for them","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121850893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Verifying Correctness of Web Services Choreography","authors":"T. Melliti, Céline Boutrous-Saab, S. Rampacek","doi":"10.1109/ECOWS.2006.38","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.38","url":null,"abstract":"This paper is about Web services used in distributed, inter-organizational business cooperation (choreography). In this application scenario, we have a multipart functional convention between all the involved Web services (called partners) in order to reach the purpose of the choreography. In such a scenario, two main problems can occur: i) can we determine whether the resulted composition of partner is conforming or not to the expected behavior, with respect to the initial cooperation schema? ii) Can we determine whether the cooperation is possible by considering the individual partners' behaviors? i.e., are the different partners' behaviors compatible between them? In this paper, we address the second problem. We propose a method to model partners' behaviors and to check the correctness of the choreography (deadlock-free) based on the properties of one partner's behavior","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124038115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enhanced Specifications for Web Service Composition","authors":"Vassiliki Alevizou, D. Plexousakis","doi":"10.1109/ECOWS.2006.15","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.15","url":null,"abstract":"The service-oriented computing research community has devoted a great deal of attention to Web service specification, discovery and composition. The ability to efficiently select and compose services in order to accomplish a complex user goal is of utmost importance. However, the problem of on-demand composition still lacks satisfactory solutions for the case of complex services intending to serve non-elementary goals and adhering to constraints. Current service specification proposals include definitions of pre-and post-conditions, i.e., conditions that must be satisfied in the state prior to and after the enactment of the service. However, due to the need for complex compositions, conditions and constraints that do not exist in the individual service specifications arise. For the definition of these conditions, we augment service specifications with invariants and demonstrate how such assertions can be exploited for determining service effects and compositionality","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130088443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Building Business Processes or Assembling Service Components: Reuse Services with BPEL4WS and SCA","authors":"Zhile Zou, Zhenhua Duan","doi":"10.1109/ECOWS.2006.11","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.11","url":null,"abstract":"The service-oriented architecture (SOA) has attracted lots of attentions these days. However, SOA is essentially a design methodology that has existed for decades, and doesn't provide enough details about the development, reuse and integration of the services. The Business Process Execution Language for Web services (BPEL4WS) has offered a formal specification for integrating loosely coupled services and building flexible business processes. And the newly emerging service component architecture (SCA) provides a set of specifications which describe a model for implementing SCA service components and assembling existing services. Despite the differences in their mechanisms for reusing and integrating services in SOA, they complement each other in nature. In this paper, we present in-depth discussions about their features, and combine them to achieve useful service reuse patterns for building non-trivial applications in SOA","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121030636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multilingual Semantics in the Request-Service Matchmaking","authors":"Alexandra Galatescu","doi":"10.1109/ECOWS.2006.27","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.27","url":null,"abstract":"The paper motivates the multilingualism and gives the main results of an analysis of the multilingualism problems in a system aiming at the ontology-based integration of transnational Web services. The focus in this paper is on the possible premises (preconditions) in such a system and on a solution for the multilingual request-service matchmaking (service discovery based on the requestor's preferences), for two alternative cases, depending on the language the service providers use for the definition of their services","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114667191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Semantic QoS Metric Matching","authors":"K. Kritikos, D. Plexousakis","doi":"10.1109/ECOWS.2006.34","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.34","url":null,"abstract":"As the Web service paradigm gains popularity for its promise to transform the way business is conducted, the number of deployed Web services grows with a fast rate. While sophisticated semantic discovery mechanisms have been invented to overcome the UDDI's syntactic discovery solution in order to provide more recallable and precise results, the amount of functionally equivalent Web services returned is still large. The solution to this problem is the description of the QoS non-functional aspect of Web services. QoS encompasses the performance of Web services and can be used as a discriminator factor for refining Web service advertisement result lists. However, most scientific efforts presented so far are purely syntactic and are not capturing all aspects of QoS-based Web service description leading to imprecise syntactic discovery mechanisms. This paper presents a novel, rich and extensible ontology-based approach for describing QoS of Web services that complements OWL-S. It is shown that, by using this approach and by introducing the concept of semantic QoS metric matching, QoS-based syntactic matchmaking and selection algorithms are transformed to semantic ones leading to better results","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"46 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128973619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adopting Default Reasoning in Service Composition Context","authors":"Z. Lu, A. Ghose, P. Hyland","doi":"10.1109/ECOWS.2006.8","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.8","url":null,"abstract":"Web service composition is the ability of one business to provide value-added services to its customers through the composition of basic Web services, possibly offered by different companies. Because of distributed responsibilities, ownership and control, it is often not feasible to acquire all information needed for service composition. These characteristics are fundamental to service oriented computing but make it inherently difficult to avoid service conflicts. To reason about and adapt to a changing environment, in this work, we will extend current OWLS by introducing the concept of service assumptions which allow reasoning with incomplete information. Furthermore, together with the proposed service assumptions, a sequence of rules is proposed to describe all permitted behaviors in service composition context","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124525944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"WSMO-MX: A Logic Programming Based Hybrid Service Matchmaker","authors":"Frank Kaufer, M. Klusch","doi":"10.1109/ECOWS.2006.39","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.39","url":null,"abstract":"In this paper, we present an approach to hybrid semantic Web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, called WSMO-MX, applies different matching filters to retrieve WSMO-oriented service descriptions that are semantically relevant to a given query with respect to seven degrees of hybrid matching. These degrees are recursively computed by aggregated valuations of ontology based type matching, logical constraint and relation matching, and syntactic similarity as well","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"182 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131652229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Graph-Based Framework for Composition of Stateless Web Services","authors":"Seyyed Vahid Hashemian, F. Mavaddat","doi":"10.1109/ECOWS.2006.2","DOIUrl":"https://doi.org/10.1109/ECOWS.2006.2","url":null,"abstract":"During the past few years, Web services composition has been one of the ongoing research activities in the software engineering area. It is simply defined as finding a composition of available Web services that provides a requested behavior. In this paper, we study this problem for stateless Web services; i.e., Web services with a two-step workflow: receiving some inputs and returning some outputs as the result. Using a graph model we represent the behavior of available Web services in terms of their input-output information, as well as semantic information about the Web data. We also introduce a process algebra to specify the behavior of composite Web services based on the behavior of simpler ones. Using the graph and the process algebra, we explain how to find useful Web services for a request and how to compose them to obtain the expected behavior. We discuss the complexity of this approach and show that although it is a naturally complex process, by applying some simplifications, a reasonable overall complexity can be achieved","PeriodicalId":365520,"journal":{"name":"2006 European Conference on Web Services (ECOWS'06)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116659983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}