A Method for the Design of Fault Detection Experiments

DOI10.1109/T-C.1970.222975MaRDI QIDQ5591525zbMATH OpenOpenAlexFDO

Authors Güney Gönenc

Publication date 1970

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

Full work available at URL https://doi.org/10.1109/t-c.1970.222975

zbMATH Keywords

languages, automata, networks

Cited in

(13)

• Exact solutions for the construction of optimal length test sequences
• Timed implementation relations for the distributed test architecture
• Introducing complexity to formal testing
• Checking sequences for distributed test architectures
• Towards deriving test sequences by model checking
• Hardness of deriving invertible sequences from finite state machines
• A study on the extended unique input/output sequence
• Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
• 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
• The relation between preset distinguishing sequences and synchronizing sequences
• Checking experiments for stream X-machines

This page was built for publication: A Method for the Design of Fault Detection Experiments

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