Checking the consistency in component models at design phase is essential in component-based software engineering (CBSE). In our previous work, we proposed an approach for verifying automatically the matching between protocol state machines (PSMs) and the use case map (UCM), using the B method. Due to the expressive power of B notations, however, we cannot describe the parallel processing in the implementation machine, particularly we are not able to express all features (such as AND-forks/joins, OR-forks/joins) of UCMs in a B implementation machine. In this work, we propose an approach to solve the expression problem of UCM features using a graph-based algorithm. The UCM path which describes the interaction between components is extracted and then decomposed into sequential events' paths if it has AND-forks/joins and/or OR-forks/joins. Each of sequential eventspsila paths will be checked with the order of events of PSMs by the proposed algorithm.

-- DanielAmyot - 05 Jan 2010


FormForVirtualLibrary edit

Title Checking the Consistency between UCM and PSM Using a Graph-Based Method
Authors Truong Ninh Thuan, Tran Thi Mai Thuong, To Van Khanh, and Nguyen Viet Ha
Type Conference
Conference/Journal Title 1st Asian Conf. on Intelligent Information and Database System (ACIIDS 09)
Publisher IEEE CS
Month April
Year 2009
Pages 190-195
DOI 10.1109/ACIIDS.2009.66
Keywords UCM, Protocol State Machine (PSM), B method
Topic revision: r2 - 05 Jul 2010, DanielAmyot
This site is powered by FoswikiCopyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding Foswiki? Send feedback