ModelingWeb Services using Semantic Graph Transformations to aid Automatic Composition

Abstract

In this paper, we propose a novel way of modeling web services using semantic graph transformations. Each operation supported by a web service is associated with a semantic annotation that describes the input and output messages using RDF graph patterns. The terms used in these patterns are defined in OWL ontologies that describe the application domain. A key difference between our model and existing semantic web service models like OWL-S is that it describes the inputs and outputs in terms of instance-based graph patterns, rather than in terms of concepts. This allows associating a rich set of constraints on the input and output data in terms of relations between instances. We also propose a composition model for web service operations, that describes the conditions for composing services into workflows. The composition model includes the notion of semantic propagation, i.e. the semantic description of the output message of an operation depends on the semantics of the input message. We have developed a planner that uses this model to compose services, automatically. The planner uses DLP reasoning to aid plan search. We present performance results for the planner.

Enhancing Control of Service Compositions in Service-Oriented Architectures

“…1 To support this process, a semantic service description, discovery and selection is required. This topic has been under substantial research lately (e. g., [6,16,10]) and is not discussed in this work.…”

Analyzing behavioral properties of semantic business processes with parametric data

“…However, they do not use variables, parametric values or instances of concepts for the description of inputs and outputs, limiting the expressiveness of the approach. As an exception, [33,34] present a planning problem that like P-U-RDF-PN describe inputs and outputs of a service in terms of instance-based graph patterns. They allow semantic propagation of the data that are known at design time but have some important limitations regarding our proposal: they ignore the data that are propagated through the process or exchanged with other processes and the data that will be only known at runtime (variables and parametric values are not considered).…”

Modeling and synthesis of service composition using tree automata

“…Recently, Liu et al [10] presented a semantic model of web services using RDF graph patterns, giving rich semantic descriptions of input and output messages of the services. A key distinguishing feature of this model is semantic propagation -the semantic description of the output message depends on that of the input -and this is done through graph transformations.…”