Scenario path identification for distributed systems: A graph based approach

A. Kanjilal, S. Sengupta, S. Bhattacharya
{"title":"Scenario path identification for distributed systems: A graph based approach","authors":"A. Kanjilal, S. Sengupta, S. Bhattacharya","doi":"10.1109/RSP.2010.5656332","DOIUrl":null,"url":null,"abstract":"With increased complexity of software systems being developed; analysis of use case scenarios is gaining importance leading to effective test case identification during early part of the life cycle. Existing approaches provide various methods for analysis of UML activity diagrams and scenario path identification based on graph models of activity diagrams. In most cases these methods consider a single activity diagram. However use case scenarios may span multiple activity diagrams, which have become quite common with distributed development of software systems. In this paper we propose Activity Relationship graph model that depicts the interrelationship of activity diagrams modeling a use case. Activity Relationship graph ARG is a hierarchical graph where each node depicts an activity diagram modeled as activity diagram graph (AG). We also define a set of metrics named Use case Scenario Paths (USP) that measures the minimum number of independent paths in ARG. An algorithm is proposed to analyze ARG and derive the number of Use case Scenario Paths. This gives a measure of the number of test paths for a requirement based on analysis models early in the life cycle.","PeriodicalId":133782,"journal":{"name":"Proceedings of 2010 21st IEEE International Symposium on Rapid System Protyping","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2010 21st IEEE International Symposium on Rapid System Protyping","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RSP.2010.5656332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

With increased complexity of software systems being developed; analysis of use case scenarios is gaining importance leading to effective test case identification during early part of the life cycle. Existing approaches provide various methods for analysis of UML activity diagrams and scenario path identification based on graph models of activity diagrams. In most cases these methods consider a single activity diagram. However use case scenarios may span multiple activity diagrams, which have become quite common with distributed development of software systems. In this paper we propose Activity Relationship graph model that depicts the interrelationship of activity diagrams modeling a use case. Activity Relationship graph ARG is a hierarchical graph where each node depicts an activity diagram modeled as activity diagram graph (AG). We also define a set of metrics named Use case Scenario Paths (USP) that measures the minimum number of independent paths in ARG. An algorithm is proposed to analyze ARG and derive the number of Use case Scenario Paths. This gives a measure of the number of test paths for a requirement based on analysis models early in the life cycle.
分布式系统的场景路径识别:基于图的方法
随着开发的软件系统越来越复杂;在生命周期的早期阶段,用例场景的分析对于有效的测试用例识别越来越重要。现有的方法为UML活动图的分析和基于活动图的图形模型的场景路径识别提供了各种方法。在大多数情况下,这些方法考虑单个活动图。然而,用例场景可能跨越多个活动图,这在软件系统的分布式开发中已经变得相当普遍。在本文中,我们提出了活动关系图模型,该模型描述了建模用例的活动图之间的相互关系。活动关系图ARG是一个分层图,其中每个节点描述一个活动图,该活动图建模为活动图(AG)。我们还定义了一组名为Use case Scenario Paths (USP)的指标,用于衡量ARG中独立路径的最小数量。提出了一种算法来分析ARG,并推导出用例场景路径的数量。这为基于生命周期早期的分析模型的需求提供了测试路径数量的度量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信