A Constrained Object Model for Configuration Based Workflow Composition

Albert, Patrick; Henocque, Laurent; Kleiner, Mathias

doi:10.1007/11678564_10

Cited by 9 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reasoning aspects of SWS composition are achieved through a two stage approach, whereby goal-level composition results provide input to process-level composition as illustrated in Figure 2. This work extends the constraint based approach presented in [1,2] where it was proved feasible to compose semantic web services orchestrations represented by workflows using configuration. The approach was experimentally validated in the DIP european project 1 .…”

Section: Figure 2 Sws Composition Processmentioning

confidence: 81%

“…This language is based on Petri nets semantics. AD-S is also defined as a COM, allowing to use configuration for workflow composition as was proved feasible in [1,2]. Figure 6 presents an overview of the AD-S metamodel.…”

Section: Integration With Process-level Compositionmentioning

confidence: 99%

“…Approaches to these problems are experimented using many formalisms and techniques, among which are Situation calculus [12], Golog [15], logic programming [22], type matching [6], Linear logic: [20], problem solving methods [8] and Ariadne [7], modal action logic [4], process algebra [17], AI Planning [19,23,18] (the list can't be exhaustive) and constraint programming [1,2,11].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An End-to-End Configuration-Based Framework for Automatic SWS Composition

Albert¹,

Henocque

Kleiner

2008

2008 20th IEEE International Conference on Tools With Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

Semantic Web Service (SWS) composition is a challenging AI problem. We describe a theoretical and experimental framework based upon finite model search for constrained object models to address this problem. In many AI situations the input is rather simple, and the results complex to obtain. SWS composition requests themselves can turn very complex, and the problem of building these requests can be viewed as an AI problem of its own. This paper presents an operational end to end approach to composing/publishing Semantic Web Services involving two main reasoning stages. Composing is first performed at the abstract level of goals (each roughly representing a discovery request), which yields a composition request at the workflow level. The resulting worklow is finally processed to generate a valid publishable semantic web service. We present experimental results obtained on industrial use cases during the DIP project.

show abstract

Section: Figure 2 Sws Composition Processmentioning

confidence: 81%

Section: Integration With Process-level Compositionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An End-to-End Configuration-Based Framework for Automatic SWS Composition

Albert¹,

Henocque

Kleiner

2008

2008 20th IEEE International Conference on Tools With Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

show abstract

“…For brevity and simplicity, in this paper we have restricted attention to finite automata, but our linguistic framework extends straightforwardly to composition methods based on other stateful models of services, e.g., Petri nets [3], workflows [2], and process algebras. Some of these formalisms are more general than finite automata, in the sense that their corresponding formal languages are a superset of regular languages.…”

Section: Automaton Service Modelsmentioning

confidence: 99%

A Language-Based Framework for Analyzing Service Representation Models and Service Composition Approaches

Yin

Motahari-Nezhad

Singhal

2010

2010 IEEE 7th International Conference on E-Business Engineering

View full text Add to dashboard Cite

Automatic service composition is an important problem in service computing. Existing works on service composition assume different representation models with various expressiveness for component services as well as for the composition logic. This has made understanding these composition approaches and their applications difficult. This paper presents a novel language-based formal framework that acts as a basis for understanding the expressiveness of service models and composition logics. It covers the three common service representation models, i.e., input/output, precondition/effects, and automaton models. The novelty of this framework is in using the execution language of service composition, characterized by logic formulae and formal languages, as a common ground to analyze service models and composition logics. We have studied the composition capability of each service model in terms of enabling common workflow patterns, and analyzed the computational complexity of composition algorithms of different service models. The framework simplifies the job of understanding service representation models and composition logics for a given service composition task.

show abstract

“…[10] argued that I/O Automata [11] are suitable as workflow formalisms. Existing service models can be largely divided into three categories: input/output (I/O) models [14,15,16], precondition/effect (P/E) models [17,18,19], and stateful (e.g., automaton) models [20,21,22]. Different service models result in different composition algorithms that generate composite services to achieve given goals.…”

Section: Introductionmentioning

confidence: 99%

Web service execution model for cloud environment

Ahmad

Changder

Sarkar

2013

SIGSOFT Softw. Eng. Notes

View full text Add to dashboard Cite

Web services describe a standardized way of integrating Web-based applications. In recent days, with the advancement of cloud computing, web services play pivoting roles towards meeting complex business objectives on a large scale. However, engineering dynamic web services is a complex task as they can be added, modified and deleted on the fly and even without any prior notification. Executing a large scale business process using dynamic web services is very challenging. This paper proposes an execution machine, called Web Service Dynamic Execution Machine (WSDE machine), which works in the execution layer of the three layered architecture for web service dynamics [23]. The proposed machine is capable of executing business processes having both deterministic and non-deterministic flows, where the related web services are represented using a graph-based semantic based formal model. The generic nature of the WSDE machine is useful in improving performance, scalability and maintainability of large scale web service based information systems. In this paper, the proposed WSDE machine is also illustrated with a suitable case study.

show abstract

A Constrained Object Model for Configuration Based Workflow Composition

Cited by 9 publications

References 16 publications

An End-to-End Configuration-Based Framework for Automatic SWS Composition

An End-to-End Configuration-Based Framework for Automatic SWS Composition

A Language-Based Framework for Analyzing Service Representation Models and Service Composition Approaches

Web service execution model for cloud environment

Contact Info

Product

Resources

About