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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International Symposium on Fault-Tolerant Computing, 18th, 1988 (FTCS-18): Digest of Papers S. 64 - 69
1. Verfasser:	Fujiwara, H.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE Comput. Soc. Press 1988
Schlagworte:	Adders Circuit faults Circuit testing Combinational circuits Computational complexity Controllability Decoding Electrical fault detection Observability Polynomials
ISBN:	9780818608674, 0818608676
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!