Comments on "Monotone Functions in Sequential Circuits"
The above paper1 by Magó discusses the state assignment problem by means of monotone increasing (i.e., positive) next-state functions for both synchronous and asynchronous sequential networks. It may be interesting to note that the same subject for synchronous sequential networks has also been studi...
Saved in:
| Published in | IEEE transactions on computers Vol. C-23; no. 9; pp. 989 - 990 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English Japanese |
| Published |
IEEE
01.09.1974
|
| Online Access | Get full text |
| ISSN | 0018-9340 |
| DOI | 10.1109/T-C.1974.224072 |
Cover
| Summary: | The above paper1 by Magó discusses the state assignment problem by means of monotone increasing (i.e., positive) next-state functions for both synchronous and asynchronous sequential networks. It may be interesting to note that the same subject for synchronous sequential networks has also been studied under a somewhat different title: "Fail-Safe Realization of Sequential Machines." This is because a realization with positive next-state functions (and positive output functions) results in a fail-safe sequential circuit in a certain sense. |
|---|---|
| ISSN: | 0018-9340 |
| DOI: | 10.1109/T-C.1974.224072 |