Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-14T08:57:11.406Z Has data issue: false hasContentIssue false

Method for Analysing Requirement Change Propagation based on a Modified Pagerank Algorithm

Published online by Cambridge University Press:  26 July 2019

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Complexity of products and systems is increasing through digitalization, interdisciplinarity as well as high technology maturity and new business models. In consequence, new product development (NPD) projects need to manage and satisfy a large number of requirements from a broad range of stakeholders. Yet, NPD projects are often delayed due to requirement changes. In this paper, a new method for analyzing requirement change propagation is presented. The method is based on the assessment of requirement interrelations structured in a requirements structure matrix by a modified page-rank algorithm. By the method, a high number of strongly interrelated requirements can be analyzed in an efficient manner. Additionally, higher-level interrelations as well as the relative weights of requirements are also incorporated in the analysis. Hereby, an efficient holistic approach towards the analysis of requirement change propagation is proposed.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BYCreative Common License - NCCreative Common License - ND
This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives licence (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is unaltered and is properly cited. The written permission of Cambridge University Press must be obtained for commercial re-use or in order to create a derivative work.
Copyright
© The Author(s) 2019