Abstract
Given a set of Unique Input Output (UIO) sequences for states of a Finite State Machine (FSM), the optimality of the length of a test sequence for the FSM can be determined with respect to the class of test sequences that satisfy the same requirements for the starting and terminating states. The first class requires test sequences to begin and end at the initial state v 1; the second class requires only that test sequences begin at the initial state v 1; and the third class imposes no requirements whatsoever on the starting and terminating states. Based on this classification, lower bounds on the length of test sequences are established. For a special case, FSMs with no convergent states, polynomial-time algorithms for the construction of optimal-length test sequences achieving these lower bounds are given.
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.
