Conference paper Open Access

# MBRP: Model-based Requirements Prioritization Using PageRank Algorithm

Muhammad Abbas, Irum Inayat , Naila Jan , Mehrdad Saadatmand, Eduard Paul Enoiu, Daniel Sundmark

### Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:creator>Muhammad Abbas, Irum Inayat , Naila Jan , Mehrdad Saadatmand, Eduard Paul Enoiu, Daniel Sundmark</dc:creator>
<dc:date>2019-12-25</dc:date>
<dc:description>Requirements prioritization plays an important role in driving project success during software development. Literature reveals that existing requirements prioritization approaches ignore vital factors such as interdependency between requirements. Existing requirements prioritization approaches are also generally time-consuming and involve substantial manual effort. Besides, these approaches show substantial limitations in terms of the number of requirements under consideration. There is some evidence suggesting that models could have a useful role in the analysis of requirements interdependency and their visualization, contributing towards the improvement of the overall requirements prioritization process. However, to date, just a handful of studies are focused on model-based strategies for requirements prioritization, considering only conflict-free functional requirements. This paper uses a meta-model-based approach to help the requirements analyst to model the requirements, stakeholders, and inter-dependencies between requirements. The model instance is then processed by our modified PageRank algorithm to prioritize the given requirements. An experiment was conducted, comparing our modified PageRank algorithm’s efficiency and accuracy with five existing requirements prioritization methods. Besides, we also compared our results with a baseline prioritized list of 104 requirements prepared by 28 graduate students. Our results show that our modified PageRank algorithm was able to prioritize the requirements more effectively and efficiently than the other prioritization methods.</dc:description>
<dc:identifier>https://zenodo.org/record/3695571</dc:identifier>
<dc:identifier>10.5281/zenodo.3695571</dc:identifier>
<dc:identifier>oai:zenodo.org:3695571</dc:identifier>
<dc:relation>info:eu-repo/grantAgreement/EC/H2020/737494/</dc:relation>
<dc:relation>doi:10.5281/zenodo.3695570</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:title>MBRP: Model-based Requirements Prioritization Using PageRank Algorithm</dc:title>
<dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
<dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>

15
105
views