Lower bounds for the length of test sequences using UIOs

DOI10.1002/NET.3230250105MaRDI QIDQ4698227zbMATHOpenAlexFDO

Authors Marion Rodrigues, Hasan Ural

Publication date 12 June 1995

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230250105

zbMATH Keywords

test sequence

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Lower bounds on lengths of checking sequences
• An optimization technique for protocol conformance testing using multiple UIO sequences
• Lower bounds for the lengths of single tests for Boolean circuits
• Lower bounds for lengths of complete diagnostic tests for circuits and inputs of circuits
• Implementation and tests of low-discrepancy sequences
• Lower bounds on the length of universal traversal sequences
• On minimizing the lengths of checking sequences
• A new algorithm for generating UIO sequences

Cites work

• Graph theory with applications

Cited in

(4)

• A new algorithm for generating UIO sequences
• Initial (final) state testing sequence, UIO sequence and synchronous sequence of the product of finite automata
• An optimization technique for protocol conformance testing using multiple UIO sequences
• Hardness of deriving invertible sequences from finite state machines

This page was built for publication: Lower bounds for the length of test sequences using UIOs

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