Protocol Test Systems 1995
DOI: 10.1007/978-0-387-34883-4_6
|View full text |Cite
|
Sign up to set email alerts
|

Selecting Test Sequences for Partially-Specified Nondeterministic Finite State Machines

Abstract: In order to test the control portion of communication software, specifications are usually fll"St abstracted to state machines, then test cases are generated from the resulting machines. The state machines obtained from the specification are often both partially-specified and nondeterministic, but no former work has been reported on test generation for such state machines. We come out with a method of generating test suites for the software that is modeled by partially-specified nondeterministic fmite state ma… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
100
0
21

Year Published

2004
2004
2012
2012

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 78 publications
(130 citation statements)
references
References 22 publications
(51 reference statements)
0
100
0
21
Order By: Relevance
“…In this paper, we consider only observable NFSMs. Each NFSM is known to have an observable FSM with the same behavior [7,8]. If D M = S×X then M is said to be a complete FSM; otherwise, it is called a partial FSM.…”
Section: Finite State Machinesmentioning
confidence: 99%
See 4 more Smart Citations
“…In this paper, we consider only observable NFSMs. Each NFSM is known to have an observable FSM with the same behavior [7,8]. If D M = S×X then M is said to be a complete FSM; otherwise, it is called a partial FSM.…”
Section: Finite State Machinesmentioning
confidence: 99%
“…We say that implementation I conforms to the specification M if and only if FSM I is quasi-equivalent to M. In other words, for each input sequence that is defined in the specification the output responses of M and I coincide [4,16,8]. Otherwise, I is called a nonconforming (or faulty) implementation of M. In this case, an input sequence α that distinguishes initial states of FSMs I and M is said to distinguish the implementation I from the specification M or α is said to detect the faulty implementation I.…”
Section: Finite State Machinesmentioning
confidence: 99%
See 3 more Smart Citations