A New Approach to Checking Sequence Generation for Finite State Machines

No Thumbnail Available

Date

2001-05-21

Journal Title

Series/Report No.

Journal ISSN

Volume Title

Publisher

Abstract

This thesis presents a formal model of checking sequencegeneration for finite state specifications, based on the machine identificationproblem. The machine identification problem is concerned with drawingconclusions about the internals of an unknown machine by performing experimentson it. Using this approach, the properties of checking sequences are describedin the context of abstract experiments. This formal model is used toprove fault coverage properties of some of the existing checking sequence generation methods. The same model is alsoused to develop two new checking sequence generation methods, one usingUIO sequences and the other using a distinguishing sequence together withUIO sequences. These two new methods do not use the reset feature.Empirical results indicate that these new methods have advantages overexisting methods for checking sequence generation.

Description

Keywords

Citation

Degree

MS

Discipline

Computer Science

Collections