2009 International Conference on Software Testing Verification and Validation 2009
DOI: 10.1109/icst.2009.29
|View full text |Cite
|
Sign up to set email alerts
|

Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
62
0
12

Year Published

2009
2009
2023
2023

Publication Types

Select...
5
4
1

Relationship

2
8

Authors

Journals

citations
Cited by 88 publications
(84 citation statements)
references
References 27 publications
0
62
0
12
Order By: Relevance
“…Currently, there are many works regarding test generation methods for EFSM models [12][13][14]. Huang [11] proposed a test sequence generation method by constructing a TEA tree.…”
Section: Figure 6 Reduce Rate Of Explored Nodesmentioning
confidence: 99%
“…Currently, there are many works regarding test generation methods for EFSM models [12][13][14]. Huang [11] proposed a test sequence generation method by constructing a TEA tree.…”
Section: Figure 6 Reduce Rate Of Explored Nodesmentioning
confidence: 99%
“…is a guard of the form e • e , where e and e are algebraic expressions and • ∈ {<, >, =, =, ≤, ≥}, op is a sequence of output and assignment operations of the form v = e with v ∈ V and e is an expression, s is the target State [17].…”
Section: State Machine Propertiesmentioning
confidence: 99%
“…Where a TP is definitely infeasible, INF 1 represents a large positive integer. The suggested penalty values are based on previous research [32] and initial experiments with one EFSM. Although the penalty values were found to be effective during the experiment, these values are by no means definitive and other suitable values can be used.…”
Section: Dependencies Representation and Penaltiesmentioning
confidence: 99%