Abstract
A general model for constructing minimal length checking sequences is proposed. The model is based on the characteristics of checking sequences and sets of state identification and verification sequences. Some existing methods are shown to be special cases of the proposed model. The minimality of the resulting checking sequences is discussed and heuristic algorithms for the construction of minimal length checking sequences 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.
