A discrete switch-level circuit model that uses 4-valued node states

Whfj Wilbert Körver · TU/e Research Portal · 1993

{properties 1.34c and 1.34d} cgdO•y* A cgdO•'Y* * {def.cgdO (1.11)} (As: SW•s : gdo•no•s A gdO•r g0•s) * {def.gdO (1.11), and (from their definition): r10 ç r gO } (As: SW•s: no•(g•s) = r g0•(g•s)) * { def.GO (1.29)} GO•I'io = GO•r g0 * {def.' Y* , ' Y* (1.32)} Î* = ' Y* From lemma 1.36, prop.l.34a, and th.1.28 follows that: WMO•C•y * Î* = ' Y* A cgdO•y* , for all C and y.Again, the question Siises whether the converse of this property holds.Intuitively, y* and y* may séem to be the least and the greatest stable state (due to def.1.29 (GO) and th.

Read the paper · More papers on PaperTik