Modelling and Verification of Compatibility of Component Composition
Loading...
Files
Date
Authors
Keywords
component compatibility, component interfaces, software architecture, component-based software, Petri nets, deadlock detection
Degree Level
Advisor
Degree Name
Volume
Issue
Publisher
Abstract
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.