Feedback in Homomorphic Realizations
IEEE Transactions on Computers
IEEE Transactions on Computers
A Scheme for Synchronizing High-Speed Logic: Part I
IEEE Transactions on Computers
Journal of Computer and System Sciences
Omega algebras and regular equations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Towards certified runtime verification
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
| Hi-index | 0.01 |
This paper concerns switching networks which consist of n identical combinational logic cells interconnected from left to right by "α" communication channels into linear arrays. The synchronous cells in these networks have unit switching delays separating their receipts of external x and left-neighbor α inputs from their corresponding productions of external z and right-neighbor α outputs. Three basic types of α transient behavior are discussed for such networks. In the first type, all transients extend to no more than a bounded number of cells to the right of each x change; in the second, all transients propagate all the way to the right boundary of the network; and in the third, any transient may or may not propagate to the right boundary of the network depending upon the x sequence to the right of the x change in question. In all three cases, necessary and sufficient conditions are given on the type of α logic allowed. These conditions are expressed in terms of corresponding α state graph structure. The paper's main results hinge on certain properties of a new type of state subgraph, and on an indirect application of permutation groups to the state-pair transition problem. A section of examples proves that individual graphs can contain any mixture of the above three types of transient behavior.