On minimizing the lengths of checking sequences

DOI10.1109/12.559807MaRDI QIDQ3417008zbMATH OpenOpenAlexFDO

Authors Hasan Ural, Xiaolin Wu, Fan Zhang

Publication date 9 January 2007

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.559807

zbMATH Keywords

testing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Lower bounds on lengths of checking sequences
• Reducing the Lengths of Checking Sequences by Overlapping
• Reduced length checking sequences
• A generalized algorithm for constructing checking sequences
• Correction to "Reduced Length Checking Sequences" [Sep 02 93-99]
• On finding minimal, maximal, and consistent sequences over a binary alphabet
• scientific article; zbMATH DE number 1796968
• The complexity of finding minimum-length generator sequences
• scientific article; zbMATH DE number 3900155
• On the average complexity for the verification of compatible sequences

Cited in

(20)

• Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
• Reduced checking sequences using unreliable reset
• Checking sequences for distributed test architectures
• Test sequence construction using minimum information on the tested system
• Removing redundant refusals: minimal complete test suites for failure trace semantics
• Model partitions and compact test case suites
• Hardness of deriving invertible sequences from finite state machines
• Reduced length checking sequences
• Using Distinguishing and UIO Sequences Together in a Checking Sequence
• Reducing the Lengths of Checking Sequences by Overlapping
• Minimizing Coordination Channels in Distributed Testing
• A generalized algorithm for constructing checking sequences
• scientific article; zbMATH DE number 220135 (Why is no real title available?)
• Lower bounds for the length of test sequences using UIOs
• Hardness and inapproximability of minimizing adaptive distinguishing sequences
• scientific article; zbMATH DE number 820496 (Why is no real title available?)
• Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
• Lower bounds on lengths of checking sequences
• On finding minimal, maximal, and consistent sequences over a binary alphabet
• Checking experiments for stream X-machines

This page was built for publication: On minimizing the lengths of checking sequences

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