An automatic reasoning mechanism for NFR goal models

Wei, B; Jin, Z; Zowghi, D

An automatic reasoning mechanism for NFR goal models

Wei, B Jin, Z Zowghi, D

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - 5th International Conference on Theoretical Aspects of Software Engineering, TASE 2011, 2011, pp. 52 - 59
Issue Date:: 2011-11-04

Closed Access

	Filename	Description	Size
	2011001659OK.pdf	Published version	942.84 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Wei, B	en_US
dc.contributor.author	Jin, Z	en_US
dc.contributor.author	Zowghi, D https://orcid.org/0000-0002-6051-0155	en_US
dc.date.issued	2011-11-04	en_US
dc.identifier.citation	Proceedings - 5th International Conference on Theoretical Aspects of Software Engineering, TASE 2011, 2011, pp. 52 - 59	en_US
dc.identifier.isbn	9780769545066	en_US
dc.identifier.uri	http://hdl.handle.net/10453/31328
dc.description.abstract	Software requirements, especially non-functional requirements, are considered as vital prerequisites for producing software of high quality. As widely accepted, non-functional goal modeling like the NFR Framework usually employs tree modeling style, and presents an interactive process for the analysis of nonfunctional requirements. However, there still exist some problems during the identification of satisficing status. This paper based on the popular NFR goal model reasoning manners, clearly distinguishes the closed world assumption and the open world assumption, and proposes an automatic reasoning mechanism for NFR goal models in order to identify the satisficing statuses of the goal tree roots according to leaves' contributions. Under a specific assumption, goals' satisficing statuses will be transformed to affect satisficing statuses of their parents. Then parents'satisficing statuses will be inferred according to the reasoning rules derived from different decomposition relationships. By alternately adopting these two steps, goal tree root's satisficingstatus can be identified layer by layer. An illustrative example is used to show how our proposed formal approach works. © 2011 IEEE.	en_US
dc.relation.ispartof	Proceedings - 5th International Conference on Theoretical Aspects of Software Engineering, TASE 2011	en_US
dc.relation.isbasedon	10.1109/TASE.2011.13	en_US
dc.title	An automatic reasoning mechanism for NFR goal models	en_US
dc.type	Conference Proceeding
utslib.for	0806 Information Systems	en_US
dc.location.activity	Xian, China
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/DVC (Research)
pubs.organisational-group	/University of Technology Sydney/DVC (Research)/Graduate Research School
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Systems, Management and Leadership
pubs.organisational-group	/University of Technology Sydney/Strength - HCTD - Human Centred Technology Design
pubs.organisational-group	/University of Technology Sydney/Strength - STEM Education Futures
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

Software requirements, especially non-functional requirements, are considered as vital prerequisites for producing software of high quality. As widely accepted, non-functional goal modeling like the NFR Framework usually employs tree modeling style, and presents an interactive process for the analysis of nonfunctional requirements. However, there still exist some problems during the identification of satisficing status. This paper based on the popular NFR goal model reasoning manners, clearly distinguishes the closed world assumption and the open world assumption, and proposes an automatic reasoning mechanism for NFR goal models in order to identify the satisficing statuses of the goal tree roots according to leaves' contributions. Under a specific assumption, goals' satisficing statuses will be transformed to affect satisficing statuses of their parents. Then parents'satisficing statuses will be inferred according to the reasoning rules derived from different decomposition relationships. By alternately adopting these two steps, goal tree root's satisficingstatus can be identified layer by layer. An illustrative example is used to show how our proposed formal approach works. © 2011 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/31328