Reduced length checking sequences

DOI10.1109/TC.2002.1032630zbMath1368.68236MaRDI QIDQ3417030

Hasan Ural, Robert M. Hierons

Publication date: 9 January 2007

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

zbMATH Keywords

distinguishing sequence

Mathematics Subject Classification ID

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

Related Items (9)

Testing conformance of a deterministic implementation against a non-deterministic stream X-machine ⋮ Checking sequences for distributed test architectures ⋮ Lower bounds on lengths of checking sequences ⋮ Hardness of Deriving Invertible Sequences from Finite State Machines ⋮ Hardness and inapproximability of minimizing adaptive distinguishing sequences ⋮ Checking experiments for stream X-machines ⋮ Minimizing Coordination Channels in Distributed Testing ⋮ Testing from a stochastic timed system with a fault model ⋮ Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata

This page was built for publication: Reduced length checking sequences