Design of easily testable discrete devices: Ideas, methods, implementation

MaRDI QIDQ801801zbMATH OpenFDO

Authors A. P. Goryashko

Publication date 1984

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

design of easily testable discrete devicesfailure diagnostic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Reliability, availability, maintenance, inspection in operations research (90B25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Theory of software (68N99)

Recommendations

• Design of easily testable combinational circuits
• scientific article; zbMATH DE number 1216281
• Converting circuits of functional elements into easily testable forms
• Structural approach to functional faults testing in discrete devices
• scientific article; zbMATH DE number 555222
• Decomposition of discrete devices for testable transformation
• scientific article; zbMATH DE number 4045655
• Method of synthesis of easily tested circuits
• Constructing tests for networks of integrated circuits

Cited in

(10)

• scientific article; zbMATH DE number 7300422 (Why is no real title available?)
• Programmable associative array for design of discrete components
• Nonlinear automata over a finite ring
• Optimization of parallel-series self-testing for discrete devices
• Design of easily testable combinational circuits
• Survey of software design for testability
• Decomposition of discrete devices for testable transformation
• Method of synthesis of easily tested circuits
• Multilevel block design of discrete devices using algorithmic algebras
• scientific article; zbMATH DE number 3934746 (Why is no real title available?)

This page was built for publication: Design of easily testable discrete devices: Ideas, methods, implementation

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