Modelling and Verification of Compatibility of Component Composition

Zuberek, W. M. (2004) Modelling and Verification of Compatibility of Component Composition. In: Third Workshop on Modelling of Objects, Components, and Agents, 11-13 October 2004, Aarhus, Denmark. (Submitted)

[img] [English] PDF - Submitted Version
Available under License Creative Commons Attribution Non-commercial.

Download (267kB)


Two components are compatible if any sequence of operations requested by one of these components can be provided by the other component. If the set of all requested sequences is denoted by LR and the set of all provided sequences of operations by LP , then the two components are compatible if LR ⊆ LP . This paper uses Petri nets to model the interface behaviours of interacting components (i.e. the languages LR and LP ) and formally deines the composition of components. Compatibility of components is verified by checking if the composed models contain deadlocks. Simple examples illustrate the proposed approach.

Item Type: Conference or Workshop Item (Paper)
Item ID: 14565
Keywords: component compatibility, component interfaces, software architecture, component-based software, Petri nets, deadlock detection
Department(s): Science, Faculty of > Computer Science
Date: October 2004
Date Type: Submission
Related URLs:

Actions (login required)

View Item View Item


Downloads per month over the past year

View more statistics