Compatibility of Software Components - Modeling and Verification

Craig, Donald C.; Zuberek, W.M.

doi:10.1109/depcos-relcomex.2006.13

Cited by 21 publications

(32 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The behavior of a component, at its interface, can be represented by a cyclic labeled Petri net [6] [20]:…”

Section: Modeling Component Behaviormentioning

confidence: 99%

Service Renaming in Component Composition

Zuberek

2013

Complex Systems and Dependability

View full text Add to dashboard Cite

In component-based systems, the behavior of components is usually described at component interfaces and the components are characterized as requester (active) and provider (reactive) components. Two interacting components are considered compatible if all possible sequences of services requested by one component can be provided by the other component. This concept of component compatibility can be extended to sets of interacting components, however, in the case of several requester components interacting with one or more provider components, as is typically the case of client-server applications, the requests from different components can be interleaved and then verifying component compatibility must take into account all possible interleavings of requests. Such interleaving of requests can lead to unexpected behavior of the composed system, e.g. a deadlock can occur. Service renaming is proposed as a method of systematic eliminating of such unexpected effects and streamlining component compositions.

show abstract

“…The behavior of a component, at its interface, can be represented by a cyclic labeled Petri net [6] [20]:…”

Section: Modeling Component Behaviormentioning

confidence: 99%

Service Renaming in Component Composition

Zuberek

2013

Complex Systems and Dependability

View full text Add to dashboard Cite

show abstract

“…The composition operation follows the CORD (compatible or deadlocked) composition proposed in [4], [5], [6] for the verification of component compatibility.…”

Section: Component Compositionmentioning

confidence: 99%

“…For a single service (denoted by "a"), the composition is outlined in Fig.1, which shows a fragment of requester and provider interfaces before and after composition [4] [5]. The composition of an r-interface N i with a p-interface N j , with the same sets of services S = S i = S j , is a net N ij = (P ij , T ij , A ij , m ij , c ij , f ij , S, ℓ ij ) where:…”

Section: Composition Of a Single Requester With A Single Providermentioning

confidence: 99%

See 1 more Smart Citation

Performance Analysis of Component-Based Systems

Zuberek

Bluemke²

2008

2008 Third International Conference on Dependability of Computer Systems DepCoS-RELCOMEX

View full text Add to dashboard Cite

show abstract

“…Therefore a "dynamic" (or behavioral) compatibility is used, and two components are compatible in the behavioral sense if all possible sequences of services requested by one of the interacting components can be provided by the other component. This paper discusses algorithmic aspects of the verification of behavioral compatibility of components which are represented by labeled Petri nets; it is a continuation of an earlier paper [8] that discussed behavioral compatibility in a conceptual way (with numerous illustrations in the form of Petri net models).…”

Section: Introductionmentioning

confidence: 99%