Name
Abstract | ||
|---|---|---|
The correspondence deals with the fail-safe realization of synchronous sequential machines under the assumption that the next-state functions are in any positive form. This leads to new classes of assignments called positive fail-safe assignment's (PFSA) The feasibility conditions of such assignments are given and systematic procedures are presented for deriving them using k-out-of-n codes. |
Year | DOI | Venue |
|---|---|---|
1979 | 10.1109/TC.1979.1675309 | IEEE Transactions on Computers |
Keywords | DocType | Volume |
positive fail-safe assignment,positive fail-safe realization,synchronous sequential machines,feasibility condition,positive form,synchronous sequential machine,next-state function,new class,correspondence deal,fail-safe realization,systematic procedure,k-out-of-n code,fail safe | Journal | C-28 |
Issue | ISSN | Citations |
2 | 0018-9340 | 0 |
PageRank | References | Authors |
0.34 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Halatsis | 1 | 1 | 0.75 |
| N. Gaitanis | 2 | 117 | 19.48 |