Open AccessConcurrency coverage criteria for activity diagrams
Author(s) -
Shirole Mahesh,
Kumar Rajeev
Publication year - 2021
Publication title -
iet software
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.305
H-Index - 43
eISSN - 1751-8814
pISSN - 1751-8806
DOI - 10.1049/sfw2.12009
Subject(s) - interleaving , concurrency , computer science , activity diagram , set (abstract data type) , unified modeling language , path (computing) , deadlock , synchronization (alternating current) , programming language , distributed computing , theoretical computer science , operating system , software , computer network , channel (broadcasting)
Existing coverage criteria for Unified Modeling Language (UML)‐based system design have used mostly structural constructs and sequential‐behavioural coverage criteria. However, concurrent‐behavioural coverage criteria are not sufficiently explored. The basic path coverage criteria, in UML‐based system design, do not distinguish between non‐interleaving and interleaving execution paths in concurrent activity diagrams. Herein, the main contribution is to present a new set of coverage criteria, based on activity‐interleaving paths for concurrent activity diagrams. For this, first, we modified the definitions of basic path and basic path coverage criterion, and then we defined the interleaving activity path, interleaving activity path coverage, and total activity path coverage criteria. It is observed that the proposed coverage criteria explore most of the concurrency behaviours to uncover concurrency errors. They help to uncover different types of concurrency errors like synchronization, data‐race, and deadlock.