Evaluating the effectiveness of risk containers to isolate change propagation

2021 ◽  
Vol 176 ◽  
pp. 110947
Author(s):  
Andrew Leigh ◽  
Michel Wermelinger ◽  
Andrea Zisman
Keyword(s):  
1998 ◽  
Vol 27 (3) ◽  
pp. 22-27 ◽  
Author(s):  
Timothy Griffin ◽  
Bharat Kumar
Keyword(s):  

2015 ◽  
Vol 35 (3) ◽  
pp. 269-280 ◽  
Author(s):  
Hu Qiao ◽  
Rong Mo ◽  
Ying Xiang

Purpose – The purpose of this paper is to establish an adaptive assembly, to realize the adaptive changing of the models and to improve the flexibility and reliability of assembly change. For a three-dimensional (3D) computer-aided design (CAD) assembly in a changing process, there are two practical problems. One is delivering parameters’ information not smoothly. The other one is to easily destroy an assembly structure. Design/methodology/approach – The paper establishes associated parameters design structure matrix of related parts, and predicts possible propagation paths of the parameters. Based on the predicted path, structured storage is made for the affected parameters, tolerance range and the calculation relations. The study combines structured path information and all constrained assemblies to build the adaptive assembly, proposes an adaptive change algorithm for assembly changing and discusses the extendibility of the adaptive assembly. Findings – The approach would improve the flexibility and reliability of assembly change and be applied to different CAD platform. Practical implications – The examples illustrate the construction and adaptive behavior of the assembly and verify the feasibility and reasonability of the adaptive assembly in practical application. Originality/value – The adaptive assembly model proposed in the paper is an original method to assembly change. And compared with other methods, good results have been obtained.


Author(s):  
Claudia Eckert ◽  
John Clarkson ◽  
Chris Earl

Design changes can be surprisingly complex. We examine the problems they cause and discuss the problems involved in predicting how changes propagate, based on empirical studies. To assist this analysis we distinguish between (a) a static background of connectivities (b) descriptions of designs, processes, resources and requirements and (c) the dynamics of design tasks acting on descriptions. The background might consist of existing designs and subsystems, or established processes used to create them. The predictability of design change is examined in terms of this model, especially the types and scope of uncertainties and where complexities arise. An industrial example of change propagation is presented in terms of the background (connectivity) - description - action model.


2017 ◽  
Vol 139 (12) ◽  
Author(s):  
Inayat Ullah ◽  
Dunbing Tang ◽  
Qi Wang ◽  
Leilei Yin

Product family (PF) design is a widely used strategy in the industry, as it allows meeting diverse design requirements. Change propagation in any PF is difficult to predict. Consequently, while numerous design change management methodologies presently exist, their application is restricted to a single artifact. This issue is overcome in the present study. The proposed framework explores effective change propagation paths (CPPs) by considering the risks associated with design changes in the PF with the aim of minimizing the overall redesign cost. The propagated risk, which would result in rework, is quantified in terms of change impact and propagation likelihood. Moreover, a design structure matrix (DSM) based mathematical model and an algorithm for its implementation are proposed to investigate the change propagation across the PF. Finally, to demonstrate their effectiveness, a PF of electric kettles is examined in a case study. The study findings confirm that the proposed technique is appropriate for evaluating different CPPs in PF.


2018 ◽  
Vol 98 ◽  
pp. 134-144 ◽  
Author(s):  
Ameni Eltaief ◽  
Borhen Louhichi ◽  
Sébastien Remy
Keyword(s):  

2005 ◽  
Vol 129 (2) ◽  
pp. 227-233 ◽  
Author(s):  
Simon Li ◽  
Li Chen

We have developed a decomposition-based rapid redesign methodology for large and complex computational redesign problems. While the overall methodology consists of two general steps: diagnosis and repair, in this paper we focus on the repair step in which decomposition patterns are utilized for redesign planning. Resulting from design diagnosis, a typical decomposition pattern solution to a given redesign problem indicates the portions of the design model necessary for recomputation as well as the interaction part within the model accountable for design change propagation. Following this, in this paper we suggest repair actions with an approach derived from an input pattern solution, to generate a redesign road map allowing for taking a shortcut in the redesign solution process. To do so, a two-stage redesign planning approach from recomputation strategy selection to redesign road map generation is proposed. An example problem concerning the redesign of a relief valve is used for illustration and validation.


2010 ◽  
Vol 6 (4) ◽  
pp. 597-608 ◽  
Author(s):  
Chetna Gupta ◽  
Yogesh Singh ◽  
Durg Singh Chauhan

2021 ◽  
Author(s):  
Lizhe Chen ◽  
Ji Wu ◽  
Haiyan Yang ◽  
Kui Zhang

Abstract Regression testing is required in each iteration of microservice systems. Regression testing selection, which reduces testing costs by selecting a subset from the original test cases, is one of the main techniques to optimize regression testing. Existing techniques mainly rely on the information retrieved from artifacts such as code files and system models. For microservice systems with service autonomy, development method diversity and a large amount of services, such artifacts are too difficultly obtained and costly processed to apply those approaches. This paper presents a regression testing selection approach called MRTS-BP, which needs the API gateway layer logs instead of code files and system models as inputs. By parsing the API gateway layer logs, our approach establishes the service dependency matrix, which in further is transformed into a directed graph with the services as nodes. Then, to find out which test cases are affected by service changes, an algorithm based on belief propagation is presented to compute the quantitative results of service-change propagation from the directed graph. Finally, the relationships between original test cases and service-change propagation results are established to select test cases with three strategies. To evaluate the efficiency of MRTS-BP, the empirical study based on four microservice systems is presented. A typical technique RTS-CFG is compared with MRTS-CFG and four experiments are setup to investigate four research questions. The results show that MRTS-BP can not only reduce the number of test cases by half compared with the retest-all strategy while ensuring the safety, but also save at least 20% testing time costs more than that of RTS-CFG. MRTS-BP is more practical than the techniques relying on the artifacts when the latter cannot be implemented due to the artifacts are difficult to obtain and process.


Sign in / Sign up

Export Citation Format

Share Document