Algebraic analysis of multiple faults in combinational networks
From MaRDI portal
Publication:3887348
DOI10.1080/00207728008967064zbMATH Open0443.94022OpenAlexW1967299591MaRDI QIDQ3887348FDOQ3887348
Authors: Pradip K. Srimani
Publication date: 1980
Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207728008967064
Recommendations
- Unconstrained algorithm for multiple fault detection in combinational networks
- scientific article; zbMATH DE number 3963736
- A decomposition scheme for the analysis of fault trees and other combinatorial circuits
- Fault detection in combinational networks by Reed-Muller transforms
- Algebraic approaches for fault identification in discrete-event systems
- Fault-tolerant analysis of a class of networks
- Algebraic Methods Applied to Network Reliability Problems
- Analytical redundancy relations for fault detection and isolation in algebraic dynamic systems
Boolean differencecombinational logic networksalgebraic analysis of multiple faultscomplete test sets
Cites Work
Cited In (10)
- Title not available (Why is that?)
- A graph-theoretic multiple logic fault analysis through petri-nets
- Faults detection in combinational circuits of OR-coincidence type universal logic gates
- A decomposition scheme for the analysis of fault trees and other combinatorial circuits
- Title not available (Why is that?)
- ANALYZING MULTIPLE FAULTS IN SYNCHRONOUS SEQUENTIAL CIRCUITS BY BOOLEAN DIFFERENCE TECHNIQUES
- Title not available (Why is that?)
- Short story of the term “algebraic analysis”
- An Algebraic Model of Fault-Masking Logic Circuits
- Unconstrained algorithm for multiple fault detection in combinational networks
This page was built for publication: Algebraic analysis of multiple faults in combinational networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887348)