A graph-theoretic multiple logic fault analysis through petri-nets

DOI10.1080/00207168808803663zbMath0658.68074OpenAlexW2059855251MaRDI QIDQ3806835

Ranajit Kishore Thakur, Kripasindhu Chaudhuri

Publication date: 1988

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168808803663

zbMATH Keywords

fault detectionPetri netlogic circuitBoolean differencecomplete test set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of graph theory to circuits and networks (94C15)

Cites Work

• The Boolean Difference and Multiple Fault Analysis
• Analyzing Errors with the Boolean Difference
• Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences
• Path Sensitization, Partial Boolean Difference, and Automated Fault Diagnosis
• An Efficient Algorithm for Generating Complete Test Sets for Combinational Logic Circuits
• Boolean Difference Calculus and Fault Finding

This page was built for publication: A graph-theoretic multiple logic fault analysis through petri-nets