On minimizing the lengths of checking sequences

DOI10.1109/12.559807zbMath1368.68242OpenAlexW2143941698MaRDI QIDQ3417008

Xiaolin Wu, Hasan Ural, 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)

Related Items (10)

Testing conformance of a deterministic implementation against a non-deterministic stream X-machine ⋮ Checking sequences for distributed test architectures ⋮ MODEL PARTITIONS AND COMPACT TEST CASE SUITES ⋮ Lower bounds on lengths of checking sequences ⋮ Removing redundant refusals: minimal complete test suites for failure trace semantics ⋮ 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 ⋮ Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata

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