IPSI-PF.A business process matchmaking engine based on annotated finite state automata

Wombacher, Andreas; Mahleko, Bendick; Neuhold, Erich J.

doi:10.1007/s10257-005-0053-y

Cited by 16 publications

(13 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…With regard to practical applicability of the presented results, we can refer to prior work on transforming a BPEL subset into FSA [31]. Furthermore, the results derived from this study are applicable to service discovery by applying it to the service discovery engine [11] which is based on service matchmaking [32].…”

Section: A Formal Workflow Modelmentioning

confidence: 95%

See 1 more Smart Citation

Alternative Approaches for Workflow Similarity

Wombacher

2010

2010 IEEE International Conference on Services Computing

Self Cite

View full text Add to dashboard Cite

Abstract-Service discovery of state dependent services has to take workflow aspects into account. To increase the usability of a service discovery, the result list of services should be ordered with regard to the relevance of the services. Means of ordering a list of workflows is a similarity measure of the workflow and a query. In this paper different similarity measures facilitating structured workflows and higher level change operations are presented and evaluated based on a pilot of an empirical study. In particular the different measures are compared with the study results. It turns out that the quality of the different measures differ significantly. The best results can be achieved by facilitating n-gram multisets as a workflow as a basis for the similarity measure calculations.

show abstract

Section: A Formal Workflow Modelmentioning

confidence: 95%

“…Let's consider a choreography based service search engine like e.g. [11] which may result in the following two scenarios:…”

Section: Introductionmentioning

confidence: 99%

Alternative Approaches for Workflow Similarity

Wombacher

2010

2010 IEEE International Conference on Services Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…This is the case of annotated automata [24] and operating guidelines [21,19]. While both formalisms have a product (or parallel) composition operator, they are missing the optimistic view of composition and also the conjunction operator that turns out to be instrumental as soon as components are described according to several distinct but interacting viewpoints [23].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Ensuring Reachability by Design

Caillaud

Raclet

2012

Theoretical Aspects of Computing – ICTAC 2012

View full text Add to dashboard Cite

Modular design aims at decomposing systems as a set of distinct components that can be independently developed and then assembled all together. Interfaces are then attached to components; they abstract implementation details while exposing to the environment relevant information about cross-component interactions. Whereas state-of-the-art on interfaces essentially consider independent implementability of safety properties, we consider in this paper reachability properties, which are in general not compositional. The approach we advocate consists in controlling the design flow of components, that is, the evolution of their interfaces through combinations and refinements, in order to ensure a reachability property by construction. Modal specifications are widely acknowledged as a suitable specification formalism for interfacebased design. In order to obtain the required expressivity, we extend them with marked states to model states to be reached. We then develop an algebra with both logical and structural composition operators ensuring reachability properties by design.

show abstract

“…In this article, we contribute to the behavioral aspects of matchmaking which include proper interaction between the matched services. In most articles on this issue [1], [2], deadlock freedom is used as a definition of proper interaction. However, livelock freedom (a livelock is a set of states that cannot be escaped and does not contain a terminal state) is undisputably a desirable property as well.…”

Section: Background and Motivationmentioning

confidence: 99%

Verifying Deadlock- and Livelock Freedom in an SOA Scenario

Wolf

Stahl

Ott

et al. 2009

2009 Ninth International Conference on Application of Concurrency to System Design

View full text Add to dashboard Cite

In a service-oriented architecture (SOA), a service broker assigns a previously published service (stored in a service registry) to a service requester. It is desirable for the composition of the requesting and the assigned service to interact properly. While proper interaction is often reduced to deadlock freedom of the composed system, we additionally consider livelock freedom as a desirable property for the interaction of services. In principle, deadlock-and livelock freedom can be verified by inspecting the state space of the composition of (public views of) the involved services.The contribution of this paper is to propose a methodology to build that state space from pre-computed fragments which are computed upon publishing a service. That way, we shift computation time from the time critical "request" phase of service brokerage to the less critical "publish" phase. Interestingly, our setting enables state space reduction methods that are intrinsically different from traditional state space reductions.

show abstract

IPSI-PF.A business process matchmaking engine based on annotated finite state automata

Cited by 16 publications

References 27 publications

Alternative Approaches for Workflow Similarity

Alternative Approaches for Workflow Similarity

Ensuring Reachability by Design

Verifying Deadlock- and Livelock Freedom in an SOA Scenario

Contact Info

Product

Resources

About