A new algorithm for generating UIO sequences

zbMATH Open1109.68508MaRDI QIDQ3370582FDOQ3370582

Authors: Junwei Xu, Bao-Hua Zhao, Yugui Qu 

Publication date: 8 February 2006

Recommendations

• A study on the extended unique input/output sequence
• Hardness of deriving invertible sequences from finite state machines
• Lower bounds for the length of test sequences using UIOs
• Computing the optimal IO sequences of a protocol in polynomial time
• Graph Algorithms for Conformance Testing Using the Rural Chinese Postman Tour

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Cited In (5)

• Hardness of deriving invertible sequences from finite state machines
• A study on the extended unique input/output sequence
• Lower bounds for the length of test sequences using UIOs
• Formal Approaches to Software Testing
• Synthesis of finite state machines for improved state verification

This page was built for publication: A new algorithm for generating UIO sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370582)