AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

Activity Diagram Synthesis Using Labelled Graphs and the Genetic Algorithm

Key Laboratory of High Confidence Software Technology (Ministry of Education), Peking University, Beijing, 100871, China
Institute of Software, School of Electronics Engineering and Computer Science, Peking University, Beijing, 100871, China
School of Computer Science, Inner Mongolia Normal University, Hohhot, 010022, China
Faculty of Engineering and Information Technology, University of Technology Sydney, Sydney, 2007, Australia

A preliminary version of the paper was published in the Proceedings of APRES 2017.

Show Author Information

Abstract

Many applications need to meet diverse requirements of a large-scale distributed user group. That challenges the current requirements engineering techniques. Crowd-based requirements engineering was proposed as an umbrella term for dealing with the requirements development in the context of the large-scale user group. However, there are still many issues. Among others, a key issue is how to merge these requirements to produce the synthesized requirements description when a set of requirements descriptions from different participants are received. Appropriate techniques are needed for supporting the requirements synthesis. Diagrams are widely used in industry to represent requirements. This paper chooses the activity diagrams and proposes a novel approach for the activity diagram synthesis which adopts the genetic algorithm to repeatedly modify a population of individual solutions toward an optimal solution. As a result, it can automatically generate a resulting diagram which combines the commonalities as many as possible while leveraging the variabilities of a set of input diagrams. The approach is featured by: 1) the labelled graph proposed as the representation of the candidate solutions during the iterative evolution; 2) the generalized entropy proposed and defined as the measurement of the solutions; 3) the genetic algorithm designed for sorting out the high-quality solution. Four cases of different scales are used to evaluate the effectiveness of the approach. The experimental results show that not only the approach gets high precision and recall but also the resulting diagram satisfies the properties of minimization and information preservation and can support the requirements traceability.

Electronic Supplementary Material

Download File(s)
jcst-36-6-1388-Highlights.pdf (91.1 KB)

References

【1】
【1】
 
 
Journal of Computer Science and Technology
Pages 1388-1406

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Wang C-H, Jin Z, Zhang W, et al. Activity Diagram Synthesis Using Labelled Graphs and the Genetic Algorithm. Journal of Computer Science and Technology, 2021, 36(6): 1388-1406. https://doi.org/10.1007/s11390-020-0293-9

975

Views

1

Crossref

2

Web of Science

3

Scopus

1

CSCD

Received: 17 January 2020
Accepted: 09 June 2020
Published: 30 November 2021
© Institute of Computing Technology, Chinese Academy of Sciences 2021