A Theory of Non-Deterministic Networks

  • Authors:
  • Alan Mishchenko;Robert K. Brayton

  • Affiliations:
  • University of California at Berkeley;University of California at Berkeley

  • Venue:
  • Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Both non-determinism and multi-level networks compactlycharacterize the flexibility allowed in implementing a circuit.A theory for representing and manipulating non-deterministic(ND) multi-level networks is developed. The theory supports allthe network manipulations commonly applied to deterministicbinary networks, such as node minimization, elimination, anddecomposition. It is shown that an ND network's behavior can beinterpreted in three ways, all of which coincide when the networkis deterministic. Operations performed on an ND network areanalyzed under each interpretation for changes in a network'sbehavior. Modifications of a few operations are given which mustbe used to guarantee that a network's behavior does not violateits external specification. These modifications depend on whichbehavior is being used and the location of related non-determinism.This theory has been implemented in a system,MVSIS. We provide comparisons among the uses of the various behaviors.