General theory of metastable operation

DOI10.1109/TC.1981.6312173MaRDI QIDQ3904524zbMATH OpenOpenAlexFDO

Authors L. R. Marino

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

zbMATH Keywords

asynchronous sequential networksreliabilitysynchronizersynchronous sequential networks

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Cited in

(11)

• The behavior of shared objects: Concept, pitfalls, and a new model
• Newtonian arbiters cannot be proven correct
• Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
• A new explanation of the glitch phenomenon
• HEX: scaling honeycombs is easier than scaling clock trees
• Reconciling fault-tolerant distributed computing and systems-on-chip
• Constructive Boolean circuits and the exactness of timed ternary simulation
• Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
• On specifications and proofs of timed circuits
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• Faithful dynamic timing analysis of digital circuits using continuous thresholded mode-switched ODEs

This page was built for publication: General theory of metastable operation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3904524)