Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
DOI10.1016/J.JCSS.2014.01.001zbMath1285.68007OpenAlexW2114637378WikidataQ39134773 ScholiaQ39134773MaRDI QIDQ2637656
Matthias Függer, Christoph Lenzen, Andreas Steininger, Danny Dolev, Ulrich Schmid, Markus Posch
Publication date: 13 February 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2014.01.001
metastabilityexperimentsself-stabilizationByzantine fault-toleranceclock synchronizationhardware implementationtheoretical analysisdependabilitymodeling frameworkhybrid state machines
Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (4)
Cites Work
- Unnamed Item
- Reconciling fault-tolerant distributed computing and systems-on-chip
- On the possibility and impossibility of achieving clock synchronization
- Easy impossibility proofs for distributed consensus problems
- Delay-insensitive codes - an overview
- Newtonian arbiters cannot be proven correct
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Self-stabilizing clock synchronization in the presence of Byzantine faults
- Reaching Agreement in the Presence of Faults
- General theory of metastable operation
- The Byzantine generals strike again
- Self-stabilizing systems in spite of distributed control
- Logic Synthesis for Asynchronous Controllers and Interfaces
- Self-stabilizing byzantine agreement
- Fault-tolerant algorithms for tick-generation in asynchronous logic
This page was built for publication: Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip