Deciding service composition and substitutability using extended operating guidelines

Stahl, Christian; Wolf, Karsten

doi:10.1016/j.datak.2009.02.012

Cited by 27 publications

(15 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since causal footprints capture constraints instead of the state space, this approach relates to constraint-based or property-based approaches to process modeling and verification [30][31][32]. Comparable concepts are used in [33] for service matching, an area where behavioral abstractions including interfaces [34], conversation protocols [7], behavioral signatures [35], and operating guidelines [36] are used.…”

Section: Related Workmentioning

confidence: 99%

Similarity of business process models: Metrics and evaluation

Dijkman

Dumas

Dongen

et al. 2011

Information Systems

496

303

View full text Add to dashboard Cite

a b s t r a c tIt is common for large organizations to maintain repositories of business process models in order to document and to continuously improve their operations. Given such a repository, this paper deals with the problem of retrieving those models in the repository that most closely resemble a given process model or fragment thereof. Up to now, there is a notable research gap on comparing different approaches to this problem and on evaluating them in the same setting. Therefore, this paper presents three similarity metrics that can be used to answer queries on process repositories: (i) node matching similarity that compares the labels and attributes attached to process model elements; (ii) structural similarity that compares element labels as well as the topology of process models; and (iii) behavioral similarity that compares element labels as well as causal relations captured in the process model. These metrics are experimentally evaluated in terms of precision and recall. The results show that all three metrics yield comparable results, with structural similarity slightly outperforming the other two metrics. Also, all three metrics outperform text-based search engines when it comes to searching through a repository for similar business process models.

show abstract

Section: Related Workmentioning

confidence: 99%

Similarity of business process models: Metrics and evaluation

Dijkman

Dumas

Dongen

et al. 2011

Information Systems

496

303

View full text Add to dashboard Cite

show abstract

“…This would involve, in particular, compositionality results on the preservation of local refinements by global compositions. Such results are important to achieve independent implementability and thus substitutability of components which may lead to applications of our theory to web service substitutability as considered in [27]. Actually, the refinement notion proposed in [27], called accordance there, is conceptually different from ours.…”

Section: Resultsmentioning

confidence: 95%

“…Such results are important to achieve independent implementability and thus substitutability of components which may lead to applications of our theory to web service substitutability as considered in [27]. Actually, the refinement notion proposed in [27], called accordance there, is conceptually different from ours. In [27], refinement is motivated by requiring preservation of interaction correctness of services with their communication partners.…”

Section: Resultsmentioning

confidence: 95%

“…Actually, the refinement notion proposed in [27], called accordance there, is conceptually different from ours. In [27], refinement is motivated by requiring preservation of interaction correctness of services with their communication partners. In our approach we do not consider communication partners for the refinement definition, but we compare behaviors of abstract and concrete modal Petri nets (formalized by their generated modal language specifications).…”

Section: Resultsmentioning

confidence: 99%

“…Then refinement ensures, first, that all observable execution traces of the concrete net are allowed by the abstract one, hence safety properties are preserved, and secondly, that all required transitions of the abstract net are respected by the concrete one. In modal interface theories [17,5,12] this property has then the consequence that certain required interactions are preserved by refinements, much in the spirit of [27].…”

Section: Resultsmentioning

confidence: 99%

See 2 more Smart Citations

Refinement and Asynchronous Composition of Modal Petri Nets

Elhog-Benzina

Haddad

Hennicker³

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a framework for the specification of infinite state systems based on Petri nets with distinguished may-and must-transitions (called modalities) which specify the allowed and the required behavior of refinements and hence of implementations. For any modal Petri net, we define its generated modal language specification which abstracts away silent transitions. On this basis we consider refinements of modal Petri nets by relating their generated modal language specifications. We show that this refinement relation is decidable if the underlying modal Petri nets are weakly deterministic. We also show that the membership problem for the class of weakly deterministic modal Petri nets is decidable. As an important application scenario of our approach we consider I/OPetri nets and their asynchronous composition which typically leads to an infinite state system.

show abstract

Verifying compositional equivalence between web service composition graphs

Gopal

Gangadharan

2018

Concurrency and Computation

View full text Add to dashboard Cite

Given a composition request, the formation of possible Web Service Composition Graphs (WSCGs) depends on the set of available services. Since the availability of Web services is dynamic, at any time, a new service can join or an existing service can leave the set of available services. A change in the set may bring the structural change in a previously formed WSCG. However, it is not always the case that a structural change in the WSCG brings the semantic change. In this paper, our aim is to verify the compositional equivalence between two WSCGs formed before and after the structural change caused by the change in the set of available services. Our proposed solution is based on an algebraic formalism, and by using the formalism, directed acyclic WSCGs are formed for a given composition request. Then, by using WSCGs, we propose the concept of composition expression and canonical composition expression. On the basis of the proposed concept of canonical composition expression, we verify compositional equivalence between two WSCGs. The advantage of our approach is that it reduces the equivalence verification to the subsumption checking between two algebraic expressions instead of directly using the WSCGs and solving a subgraph matching problem. The proposed mechanism is implemented and evaluated for the exhaustive possibilities in a travel agency case study with respect to a given composition request. INTRODUCTIONService-oriented computing is a well-established computing paradigm developed over time and still passing through phases of technological refinements day by day. Nowadays, automatic and dynamic Web service composition is in focus of the service-oriented computing research. 1,2 As far as automatic and dynamic service composition is concerned, the dynamic reconfiguration of services is a key factor worth considering because the availability of candidate Web services cannot be specified before the runtime. Thus, the dynamic availability of services greatly affects the formation of a composition plan (made for a composition request). In this paper, our focus is on the graphical composition plans (say, Web service composition graph).In general, by means of a Web Service Composition Graph (WSCG), we refer to the graphical representation of how a set of Web services compose with each other in order to realize a composition request (composition request is formally defined in the Section 4). A WSCG depends on the set of available services. Therefore, a change in the set may bring the structural change in the previously formed WSCG. However, this is not always the case that a structural change in the WSCG brings the semantic change. For an illustration of the problem of compositional equivalence between two WSCGs, let us consider three services TA1, TA2, and HB1, where TA1 and TA2 are composite services and HB1 is a basic service. The all three services accept request for hotel booking. Suppose a user requests TA1 for the hotel booking (written as ⟨TA1, H_Book⟩). Since TA1 is a composite service, it has to take the he...

show abstract

Deciding service composition and substitutability using extended operating guidelines

Cited by 27 publications

References 19 publications

Similarity of business process models: Metrics and evaluation

Similarity of business process models: Metrics and evaluation

Refinement and Asynchronous Composition of Modal Petri Nets

Verifying compositional equivalence between web service composition graphs

Contact Info

Product

Resources

About