Subnets Generation of Program Nets and Its Application to Software Testing

Biao WU  Xiaoan BAO  Na ZHANG  Hiromu MORITA  Mitsuru NAKATA  Qi-Wei GE  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A   No.9   pp.1303-1311
Publication Date: 2019/09/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.1303
Type of Manuscript: PAPER
Category: Mathematical Systems Science
program net,  software testing,  subnets generation,  acyclic program net,  self-cleanness,  

Full Text: PDF(1.7MB)>>
Buy this Article

Software testing is an important problem to design a large software system and it is difficult to be solved due to its computational complexity. We try to use program nets to approach this problem. As the first step towards solving software testing problem, this paper provides a technique to generate subnets of a program net and applies this technique to software testing. Firstly, definitions and properties of program nets are introduced based on our previous works, and the explanation of software testing problem is given. Secondly, polynomial algorithms are proposed to generate subnets that can cover all the given program net. Finally, a case study is presented to show how to find subnets covering a given program net by using the proposed algorithms, as well as to show the input test data of the program net for software testing.