2019
DOI: 10.1587/transfun.e102.a.1303
|View full text |Cite
|
Sign up to set email alerts
|

Subnets Generation of Program Nets and Its Application to Software Testing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(10 citation statements)
references
References 12 publications
0
10
0
Order By: Relevance
“…In this paper, we assume that all marked program nets are self-cleaning program nets with d 0 =0 as in our previous work [7]. We have designed algorithms to generate subnets (denoted by { P N i }) that can structurally cover all the nodes of a given program net [7]. These algorithms mainly carry out the following two steps: (1) making the given program net acyclic, and (2) generating subnets based on the acyclic program net.…”
Section: Program Netmentioning
confidence: 99%
See 4 more Smart Citations
“…In this paper, we assume that all marked program nets are self-cleaning program nets with d 0 =0 as in our previous work [7]. We have designed algorithms to generate subnets (denoted by { P N i }) that can structurally cover all the nodes of a given program net [7]. These algorithms mainly carry out the following two steps: (1) making the given program net acyclic, and (2) generating subnets based on the acyclic program net.…”
Section: Program Netmentioning
confidence: 99%
“…In this section, we provide algorithms to generate constraint conditions for the choiceless program nets obtained in Ref. [7] by analyzing the nets.…”
Section: Constraint Conditions Genera-tionmentioning
confidence: 99%
See 3 more Smart Citations