Computational complexity of controllability/observability problems for combinational circuits

The computational complexity of fault detection problems and various controllability and observability problems for combinational logic circuits are analyzed. It is shown that the fault detection problem is still NP-complete even for monotone circuits limited in fanout, i.e. the number of signal lin...

Full description

Bibliographic Details

Published in:	International Symposium on Fault-Tolerant Computing, 18th, 1988 (FTCS-18): Digest of Papers pp. 64 - 69
Main Author:	Fujiwara, H.
Format:	Conference Proceeding
Language:	English
Published:	IEEE Comput. Soc. Press 1988
Subjects:	Adders Circuit faults Circuit testing Combinational circuits Computational complexity Controllability Decoding Electrical fault detection Observability Polynomials
ISBN:	9780818608674, 0818608676
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!