Design of easily testable discrete devices: Ideas, methods, implementation
From MaRDI portal
Publication:801801
zbMATH Open0552.90040MaRDI QIDQ801801FDOQ801801
Authors: A. P. Goryashko 
Publication date: 1984
Published in: Automation and Remote Control (Search for Journal in Brave)
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
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)
Cited In (10)
- Design of easily testable combinational circuits
- Nonlinear automata over a finite ring
- Optimization of parallel-series self-testing for discrete devices
- Multilevel block design of discrete devices using algorithmic algebras
- Title not available (Why is that?)
- Survey of software design for testability
- Programmable associative array for design of discrete components
- Title not available (Why is that?)
- Decomposition of discrete devices for testable transformation
- Method of synthesis of easily tested circuits
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)
