A proof rule for restoring logic circuits

Authors:
J. A. Bergstra;J. W. Klop
Affiliations:
-;-
Venue:
Integration, the VLSI Journal
Year:
1983

Citing 3
Cited 0

Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to VLSI Systems

Introduction to VLSI Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

An axiomatic semantics is given for restoring logic circuits, both statically and dynamically. As an example the Muller C-element is discussed in detail. It is shown that a consistent circuit reacts in an unambiguous way on new inputs.