Abstract :
This paper is concerned with the problem of realizing an arbitrary syndconous or asynchronous sequential machine using only monotone AMR (or decreasing) switching functions. It has been found that h ion always exist, that in the asynchronous case only nomal fundamental mode flow tables are considered. Univesl state assignmments resulting in monotone inceasing (or next-state funtions are characterized using the concept of an (i,j) completely separating system.
Keywords :
Asynchronous sequential circuits, completely separating systems, monotone switching functions, separating systems, synchronous sequential circuits, univeral state assignments. The author is with the Department of Computer Science, University of North Carolina, Chapel Hill, N.C.; Boolean functions; Circuit testing; Combinatorial mathematics; Computer science; Sequential circuits; Switching circuits; Terminology; Asynchronous sequential circuits, completely separating systems, monotone switching functions, separating systems, synchronous sequential circuits, univeral state assignments. The author is with the Department of Computer Science, University of North Carolina, Chapel Hill, N.C.;
