9 citations · 32 across the 12 of their papers we have counts for
9 papers · 1 filter
On Specifications and Proofs of Timed Circuits
Matthias Fuegger, Christoph Lenzen, Ulrich Schmid
Given a discrete-state continuous-time reactive system, like a digital circuit, the classical approach is to first model it as a state transition system and then prove its properti…
PALS: Plesiochronous and Locally Synchronous Systems
Johannes Bund, Matthias Függer, Christoph Lenzen +2
Consider an arbitrary network of communicating modules on a chip, each requiring a local signal telling it when to execute a computational step. There are three common solutions to…
On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks
Matthias Függer, Thomas Nowak, Kyrill Winkler
A nonsplit graph is a directed graph where each pair of nodes has a common incoming neighbor. We show that the radius of such graphs is in , where is the number…
Tight Bounds for Asymptotic and Approximate Consensus
Matthias Függer, Thomas Nowak, Manfred Schwarz
We study the performance of asymptotic and approximate consensus algorithms under harsh environmental conditions. The asymptotic consensus problem requires a set of agents to repea…
Multidimensional Asymptotic Consensus in Dynamic Networks
Bernadette Charron-Bost, Matthias Függer, Thomas Nowak
We study the problem of asymptotic consensus as it occurs in a wide range of applications in both man-made and natural systems. In particular, we study systems with directed commun…
Amortized Averaging Algorithms for Approximate Consensus
Bernadette Charron-Bost, Matthias Függer, Thomas Nowak
We introduce a new class of distributed algorithms for the approximate consensus problem in dynamic rooted networks, which we call amortized averaging algorithms. They are deduced…
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
Bernadette Charron-Bost, Matthias Függer, Thomas Nowak
In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchro…
FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs
Danny Dolev, Matthias Függer, Christoph Lenzen +3
We present concept and implementation of a self-stabilizing Byzantine fault-tolerant distributed clock generation scheme for multi-synchronous GALS architectures in critical applic…
Fault-tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation
Danny Dolev, Matthias Fuegger, Christoph Lenzen +1
Today's hardware technology presents a new challenge in designing robust systems. Deep submicron VLSI technology introduced transient and permanent faults that were never considere…