Reduced length checking sequences

DOI10.1109/TC.2002.1032630MaRDI QIDQ3417030zbMATH OpenFDO

Authors Hasan Ural, Robert M. Hierons

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/TC.2002.1032630

zbMATH Keywords

distinguishing sequence

Mathematics Subject Classification ID

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

Recommendations

• On minimizing the lengths of checking sequences
• Lower bounds on lengths of checking sequences
• Reducing the Lengths of Checking Sequences by Overlapping
• A generalized algorithm for constructing checking sequences
• Reduced checking sequences using unreliable reset

Cited in

(16)

• Testing from a stochastic timed system with a fault model
• Reducing sequences
• 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
• Hardness of deriving invertible sequences from finite state machines
• On minimizing the lengths of 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?)
• Hardness and inapproximability of minimizing adaptive distinguishing sequences
• Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
• Lower bounds on lengths of checking sequences
• Checking experiments for stream X-machines

This page was built for publication: Reduced length checking sequences

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