8/14/2019 Using a Minimal Number of Resets When Testing

1/9

Using a Minimal Number ofUsing a Minimal Number of

Resets When TestingResets When TestingFrom a Finite State MachineFrom a Finite State Machine

R.M. HieronsInformation Processing Letters 90 (2004) 287

292

Adviser: Yue-Li Wang

As presented by Ying-Jhih Chen

8/14/2019 Using a Minimal Number of Resets When Testing

2/9

OutlineOutliney Introduction

FSM Reset

y Algorithm

y Future Work

8/14/2019 Using a Minimal Number of Resets When Testing

3/9

FSMFSMfs

state 0 1 f oS0 S0 S1 0

S1 S2 S0 1

S2 S3 S1 0S3 S1 S3 1

s0/0

S1/1

S2

/0

S3

/1

0

1

01

0

10

1

8/14/2019 Using a Minimal Number of Resets When Testing

4/9

ResetResety A reset is an operation that takes the

system from each state to the initialstate.

y More reset more cost.

S0

S1

S

2

Initial state

S0

a/0

b/0

r/-

a/0b/1

a/0

b/1

Reset!

8/14/2019 Using a Minimal Number of Resets When Testing

5/9

ExampleExample

S1

S2

S3 S4

a/0

b/0

a/0

b/1

a/0

b/1

a/1b/1

8/14/2019 Using a Minimal Number of Resets When Testing

6/9

TestsTestsNames Initial state Sequence Final state

t1a S1 a/0,b/1,a/0 S2t1b S1 b/0,a/0,a/1 S3

t2a S2 a/0,b/1,a/0 S2

t2b S2 b/1,b/1,a/0 S2t3a S3 a/0,a/1 S3

t3b S3 b/1,a/1 S3

t4a S4 a/1,a/0,a/1 S3t4b S4 b/1,a/1 S3

8/14/2019 Using a Minimal Number of Resets When Testing

7/9

AlgorithmAlgorithm

S1

S2

S3 S4

t1a

t1b

t2a

t2b

t4a t4b

t3a

t3b

Minimum symmetric augmentation

r/-

r/-

a/0 a/0

Strongly connected

Find an Euler Tour

Delete the final reset.

Test sequence

t1a, t2a, t2b, r/, t1b, t3a, t3b, a/0, t4a, a/0, t4b

8/14/2019 Using a Minimal Number of Resets When Testing

8/9

Future WorkFuture Worky Future work will consider how overlap

may be incorporated.

8/14/2019 Using a Minimal Number of Resets When Testing

9/9

ReferencesReferencesy [1]A.V.Aho,A.T. Dahbura, D. Lee, M.U. Uyar,An optimization technique for

protocol conformance test generation based on UIO sequences and RuralChinese Postman Tours, in: Protocol Specification, Testing, and Verification VIII,Atlantic City, Elsevier/North-Holland,Amsterdam, 1988, pp. 7586.

y [2] B. Broekman, E. Notenboom, Testing Embedded Software, Addison-Wesley,London, 2003.

y [3] S. Fujiwara, G. von Bochmann, F. Khendek, M. Amalou,A. Ghedamsi, Testselection based on finite state models, IEEE Trans. Software Engrg. 17 (6) (1991)591603.

y [4]A. Gibbons,Algorithmic Graph Theory, Cambridge University Press,

Cambridge, 1985.y [5] D. Lee, M. Yannakakis, Principles and methods of testing finitestate machines,

Proc. IEEE 84 (8) (1996) 10891123.

y [6] E.P. Moore, Gedanken-Experiments, in: C. Shannon, J. McCarthy (Eds.),Automata Studies, Princeton University Press, Princeton, NJ, 1956.

y [7]A. Petrenko, N. Yevtushenko, G. von Bochmann, Testing deterministic

implementations from nondeterministic FSM specifications, in: Testing ofCommunicating Systems, Darmstadt, Germany, Chapman and Hall, 1996, pp.125141.

y [8] D.P. Sidhu, T.-K. Leung, Formal methods for protocol testing:A detailed study,IEEE Trans. Software Engrg. 15 (4) (1989) 413426.

y [9] M. Yao, A. Petrenko, G. von Bochmann, Conformance testing of protocolmachines without reset, in: Protocol Specification, Testing and Verification, XIII (C-

16), Elsevier/North-Holland,Amsterdam, 1993, pp. 241256