Results 1 - 10
of
18
OWLS-MX: A Hybrid Semantic Web Service Matchmaker for OWL-S Services
, 2008
"... In this paper, we describe the first hybrid semantic Web service matchmaker for OWL-S services, called OWLS-MX. It complements crisp logic-based semantic matching of OWL-S services with token-based syntactic similarity measurements in case the former fails. The results of the experimental evaluation ..."
Abstract
-
Cited by 31 (0 self)
- Add to MetaCart
In this paper, we describe the first hybrid semantic Web service matchmaker for OWL-S services, called OWLS-MX. It complements crisp logic-based semantic matching of OWL-S services with token-based syntactic similarity measurements in case the former fails. The results of the experimental evaluation of OWLS-MX provide strong evidence for the claim that logic-based semantic matching of OWL-S services can be significantly improved by incorporating non-logic-based information retrieval techniques. An additional analysis of false positives and false negatives of the hybrid matching filters of OWLS-MX led to an even further improved matchmaker version called OWLS-MX2.
Transformations Between UML and OWL-S
- of Lecture Notes in Computer Science
, 2005
"... Abstract. As the number of available Web services increases there is a growing demand to realize complex business processes by combining and reusing avail-able Web services. The reuse and combination of services results in a composition of Web services that may also involve services provided in the ..."
Abstract
-
Cited by 19 (3 self)
- Add to MetaCart
(Show Context)
Abstract. As the number of available Web services increases there is a growing demand to realize complex business processes by combining and reusing avail-able Web services. The reuse and combination of services results in a composition of Web services that may also involve services provided in the Internet. With se-mantically described Web services, an automated matchmaking of capabilities can help identify suitable services. To address the need for semantically defined Web services, OWL-S and WSML have been proposed as competing semantic Web service languages. Both proposals are quite low-level and hard to use even for experienced Web service developers. We propose a UML profile for semantic Web services that enables the use of high-level graphical models as an integration platform for se-mantic Web services. The UML profile provides flexibility as it supports multiple semantic Web service languages. Transformations of both ways between OWL-S and UML are implemented to show that the UML profile is expressive enough to support one of the leading semantic Web service languages. 1
A Proactive approach to Semantically Oriented Service Discovery
, 2006
"... This paper proposes a proactive approach to web service discovery which contrasts the passive approach exhibited by UDDI. The paper describes how a content based network implementation (Siena) has been extended to undertake matching based on ontological reasoning, resulting in a flexible knowledge-b ..."
Abstract
-
Cited by 14 (6 self)
- Add to MetaCart
This paper proposes a proactive approach to web service discovery which contrasts the passive approach exhibited by UDDI. The paper describes how a content based network implementation (Siena) has been extended to undertake matching based on ontological reasoning, resulting in a flexible knowledge-based delivery mechanism. In particular, it describes how this implementation has been used to support the proactive and potentially more efficient delivery of advertised web service profiles to users interested in services of those types.
Large-scale service composition in semantic service discovery
- Proceedings of 2006 IEEE Joint Conference on E-Commerce Technology (CEC’06) and Enterprise Computing, E-Commerce and EServices (EEE’06), 2006
"... Self-Healing and self-optimizing service based applications are important steps towards the self-organizing Service Oriented Architectures (SOA). Self-Organizing SOAs replace services by functional equivalent services in the case of faults or in respect of quality of service. These features depend o ..."
Abstract
-
Cited by 7 (6 self)
- Add to MetaCart
(Show Context)
Self-Healing and self-optimizing service based applications are important steps towards the self-organizing Service Oriented Architectures (SOA). Self-Organizing SOAs replace services by functional equivalent services in the case of faults or in respect of quality of service. These features depend on automatic service discovery which provides service alternatives. We enter the WSC’06 contest to present a semantic service discovery system for large sets of services. A recursive algorithm builds service compositions by adding services in each iteration. The search works backwards, since we add services that produce a certain output regardless of its input parameters. A valid service composition produces a set of queried output parameters and input parameters necessary for the composed services. The algorithm is improved by using efficient data structures in our service composition system. 1.
Model-driven semantic web service composition
- In Proc. 12th Asia-Pacific Software Engineering Conference (APSEC 2005
, 2005
"... As the number of available Web services increases there is a growing demand to realise complex business processes by combining and reusing available Web services. The reuse and combination of services results in a composition of Web services that may also involve services provided in the Internet. W ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
As the number of available Web services increases there is a growing demand to realise complex business processes by combining and reusing available Web services. The reuse and combination of services results in a composition of Web services that may also involve services provided in the Internet. With semantically described Web services, an automated matchmaking of capabilities can help identify suitable services. To address the need for semantically defined Web services, OWL-S and WSML have been proposed as competing semantic Web service languages. We show how the proposed semantic Web service languages can be utilized within a model-driven methodology for building composite Web services. In addition we combine the semantic-based discovery with the support for processing QoS requirements to apply a ranking or a selection of the candidates. The methodology describes a process which guides the developer through four phases, starting with the initial modelling, and ending with a new composite service that can be deployed and published to be consumed by other users. 1
Grid Service Discovery with Rough Sets
- IEEE Transactions on Knowledge and Data Engineering
, 2008
"... Abstract—The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Service discovery becomes an issue of vital importance in utilizing grid facilities. This paper presents ROSSE, a ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
(Show Context)
Abstract—The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Service discovery becomes an issue of vital importance in utilizing grid facilities. This paper presents ROSSE, a Rough sets-based search engine for grid service discovery. Building on the Rough sets theory, ROSSE is novel in its capability to deal with the uncertainty of properties when matching services. In this way, ROSSE can discover the services that are most relevant to a service query from a functional point of view. Since functionally matched services may have distinct nonfunctional properties related to the quality of service (QoS), ROSSE introduces a QoS model to further filter matched services with their QoS values to maximize user satisfaction in service discovery. ROSSE is evaluated from the aspects of accuracy and efficiency in discovery of computing services.
DYNAMIC SERVICE RECONFIGURATION AND ENACTMENT USING AN OPEN MATCHING ARCHITECTURE
"... Automated adaptation, matching, enactment. An architecture for dynamic reconfiguration of complex services, in which the enactment is automated, and the matching of services is not limited to a pre-determined set of matchers and repositories, is presented. The proposed architecture consists of three ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
(Show Context)
Automated adaptation, matching, enactment. An architecture for dynamic reconfiguration of complex services, in which the enactment is automated, and the matching of services is not limited to a pre-determined set of matchers and repositories, is presented. The proposed architecture consists of three, previously developed, components: the CoWS template-based reconfiguration service, the Knoogle MatchMaker service, and the Triana workflow enactment engine. This architecture has the following innovative aspects: 1) automated adaptation of complex services, which is more flexible than existing approaches based on replacing failing instances of services within a workflow, 2) use of heterogeneous components that may be both local and distributed, and 3) dynamic selection of matchers and repositories. 1
Self-integration of web services in bpel processes
- In Proceedings of the Workshop Selbstorganisierence, Adaptive, Kontextsensitive verteilte Systeme
, 2008
"... Abstract. Interoperability between clients and service may not be seen as a major challenge in SOAs but in reality services under change impose a ma-jor hindrance in service management. We present a model and system for ser-vice process management where we achieve self-integration by automatic mes-s ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
(Show Context)
Abstract. Interoperability between clients and service may not be seen as a major challenge in SOAs but in reality services under change impose a ma-jor hindrance in service management. We present a model and system for ser-vice process management where we achieve self-integration by automatic mes-sage matching and runtime transformation. We have developed the necessary WSDL schema extension, a semantic discovery algorithm, and a runtime me-diation system. Our matching algorithm can detect semantically related message elements and generate appropriate XSL transformations. Finally our system dy-namically instantiates mediators to bind services to service processes specified with BPEL4WS. 1
Look Ma, No Hands: Supporting the semantic discovery of services without ontologies
"... Abstract. The work reported in this article aims to the discovery of WSDL specifications that are assessed to match to specific data requirements 1: Going beyond the syntactic level, we aim at exploiting the human-intended semantics of WSDL specifications At the core of the proposed method lies the ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract. The work reported in this article aims to the discovery of WSDL specifications that are assessed to match to specific data requirements 1: Going beyond the syntactic level, we aim at exploiting the human-intended semantics of WSDL specifications At the core of the proposed method lies the Latent Semantic Indexing (LSI) method, which automatically maps data requirements specified in a query to part elements of WSDL input and output messages. We study extensively the performance of the proposed method for different types of experiments ’ configurations. Experiments have been performed over an extended number of services for various domains, with very encouraging results.
Knowledge-Based Verification of Service Compositions – An SMT Approach
- in Engineering of Complex Computer Systems (ICECCS), 2013 18th International Conference on, July 2013. doi: 10.1109/ICECCS.2013.14
"... Abstract—In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configura-tion. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This acco ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
(Show Context)
Abstract—In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configura-tion. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This accounts to types used in service signatures, but also to predicates occurring in preconditions and effects of services. Ontologies, in particular those enhanced with rules, capture the knowledge of domain experts on properties of and relations between domain concepts. In this paper, we present a verification technique for service compositions which makes use of this domain knowledge. We consider a service composition to be an assembly of services of which we just know signatures, preconditions, and effects. We aim at proving that a composition satisfies a (user-defined) requirement, specified in terms of guaranteed preconditions and required postconditions. As an underlying verification engine we use an SMT solver. To take advantage of the domain knowledge (and often, to enable verification at all), the knowledge is fed into the solver in the form of sorts, uninterpreted functions and in particular assertions as to enhance the solver’s reasoning capabilities. Thereby, we allow for deductions within a domain previously unknown to the solver. We exemplify our technique on a case study from the area of water network optimization software. I.
