A Theory of Non-Deterministic Networks

Both non-determinism and multi-level networks compactly characterize the flexibility allowed in implementing a circuit. A theory for representing and manipulating non-deterministic (ND) networks is introduced. The theory supports the usual network manipulations, done on deterministic binary networks, such as node minimization, elimination, decomposition etc. Three ways to interpret the behavior of an ND network are given. Operations performed on ND networks are analyzed for how they can change behavior under each interpretation. Some common network operations can increase different behaviors and thus might cause the network to violate its external specification. Several methods to correct this problem are proposed.

• Type: Conference
• Year: 2003
• Where: ICCAD
• Authors: Alan Mishchenko, Robert K. Brayton
• Keywords: Deterministic Binary Networks, Hardware, ICCAD 2003, ND Networks, Usual Network Manipulations