Probability Expressions, with Applications to Fault Testing in Digital Networks
Abstract
Logical functions are usually described in terms of Boolean Expressions. In this report we employ an alternate representation for logical functions, namely in terms of Probability Expressions (P-exps). P-exps are algebraic expressions that yield the probability that an output signal takes the logical value 1, given the independent probabilities that the input signals take the value 1. In a manner similar to signal representation in time and frequency domains, we may represent logical functions in two domains: Boolean and Probabilities domains. In this report we review and present some properties of P-exps. Computational aspects of P-exps are discussed extensively, including difficulty of computer manipulation, lengths of P-exps, solution of P-exps, and transformations between the two domains. P-exps provide a computational savings in certain classes of problems. P-exps are then applied to the problem of test generation for combinational networks. Further, we derive some results concerning the random testing of combinational networks.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1983
- Accession Number
- ADA131367
Entities
People
- Warren H. Debany Jr.
Organizations
- Rome Laboratory