• DocumentCode
    2459226
  • Title

    A theory of non-deterministic networks

  • Author

    Mishchenko, Alan ; Brayton, Robert K.

  • Author_Institution
    Dept. of EECS, California Univ., Berkeley, CA, USA
  • fYear
    2003
  • fDate
    9-13 Nov. 2003
  • Firstpage
    709
  • Lastpage
    716
  • Abstract
    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) multi-level networks is developed. The theory supports all the network manipulations commonly applied to deterministic binary networks, such as node minimization, elimination, and decomposition. It is shown that an ND network´s behavior can be interpreted in three ways, all of which coincide when the network is deterministic. Operations performed on an ND network are analyzed under each interpretation for changes in a network´s behavior. Modifications of a few operations are given which must be used to guarantee that a network´s behavior does not violate its external specification. These modifications depend on which behavior 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.
  • Keywords
    graph theory; network topology; set theory; MVSIS; ND network; circuit implementation; deterministic binary network; multilevel networks; network manipulation; node decomposition; node elimination; node minimization; nondeterministic networks; Automata; Boolean functions; Circuits; Hardware; Logic gates; Minimization; Neodymium; Network synthesis; Observability; Performance analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Aided Design, 2003. ICCAD-2003. International Conference on
  • Conference_Location
    San Jose, CA, USA
  • Print_ISBN
    1-58113-762-1
  • Type

    conf

  • DOI
    10.1109/ICCAD.2003.1257887
  • Filename
    1257887