General theory of metastable operation
From MaRDI portal
Publication:3904524
DOI10.1109/TC.1981.6312173zbMath0455.94034OpenAlexW1975638748MaRDI QIDQ3904524
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1981.6312173
Related Items (10)
HEX: scaling honeycombs is easier than scaling clock trees ⋮ Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip ⋮ A new explanation of the glitch phenomenon ⋮ The behavior of shared objects: Concept, pitfalls, and a new model ⋮ On specifications and proofs of timed circuits ⋮ Reconciling fault-tolerant distributed computing and systems-on-chip ⋮ Constructive Boolean circuits and the exactness of timed ternary simulation ⋮ Universal computation and other capabilities of hybrid and continuous dynamical systems ⋮ Fault-tolerant algorithms for tick-generation in asynchronous logic ⋮ Newtonian arbiters cannot be proven correct
This page was built for publication: General theory of metastable operation