Skip to Main Content
Foundations of Software Testing: Fundamental Algorithms and Techniques
book

Foundations of Software Testing: Fundamental Algorithms and Techniques

by Aditya P. Mathur
March 2007
Intermediate to advanced content levelIntermediate to advanced
709 pages
20h 23m
English
Pearson India
Content preview from Foundations of Software Testing: Fundamental Algorithms and Techniques
Test Generation
q
1
q
3
q
2
q
4
q
5
a/0
a/0
a/0
a/1
b/1
b/1b/1
b/1 b/1
a/1
Fig. 3.13 The transition and output functions of a simple FSM.
3.5 CHARACTERIZATION SET
Most methods for generating tests from FSMs make use of an important
set known as the characterization set. This set is usually denoted by W
and is sometimes referred to as the W-set. In this section, we explain how
one can derive a W-set given the description of an FSM. Let us examine
the definition of the W-set.
Let M = (X, Y, Q, q
1
, , O) be an FSM that is minimal and com-
plete. A characterization set for M, denoted as W, is a finite set of input
sequences that distinguish the behavior of any pair of states ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

Aditya P. Mathur
Fundamentals of Computer Programming and IT by Pearson

Fundamentals of Computer Programming and IT by Pearson

Ashok Namdev Kamthane, Rohit Khurana

Publisher Resources

ISBN: 9788131707951