Abstract
The unique input/output (UIO) sequence is an important state identification technique in the FSM-based protocol conformance testing. However, some states of a FSM might have no UIO sequence. To address the above problem, this paper introduces an extended UIO sequence, called a GUIO sequence, which distinguishes a designated state from the remaining states by a group-by-group means. The problem of searching the optimal GUIO sequence is NP-hard. In this paper, we present a GUIO search method based on a greedy heuristics and a φ-hop search approach. The proposed method can obtain desirable GUIO sequences with relatively low computational complexity.
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.
