Abstract
The length of a checking sequence (CS) generated from a deterministic, minimal, and completely specified finite state machine model M of a system under test which does not have a reliable reset feature, is exponential when M does not have a distinguishing sequence. This is due to the exponential length locating sequences that need to be used in such a CS. In this work, we propose a method to decrease the number of locating sequences used in CS, by first verifying the reset input r and then using r as a reliable reset. When such a reset input is not available, a synchronizing sequence can be used as a compound reset input, which makes the proposed method applicable to a wide range of systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
