activity
20112026
most citedNew Transience Bounds for Long Walks

9 citations · 32 across the 12 of their papers we have counts for

collaborators

18 papers

cs.PL2026

Provable Coordination for LLM Agents via Message Sequence Charts

Benedikt Bollig, Matthias Függer, Thomas Nowak

Multi-agent systems built on large language models (LLMs) are difficult to reason about. Coordination errors such as deadlocks or type-mismatched messages are often hard to detect…

cs.DC2022

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…

cs.OH2021

A Composable Glitch-Aware Delay Model

Jürgen Maier, Daniel Öhlinger, Ulrich Schmid +2

We introduce the Composable Involution Delay Model (CIDM) for fast and accurate digital simulation. It is based on the Involution Delay Model (IDM) [Függer et al., IEEE TCAD 2020],…

cs.AR2020★ 1 cited

Synchronizer-Free Digital Link Controller

Johannes Bund, Matthias Függer, Christoph Lenzen +1

This work presents a producer-consumer link between two independent clock domains. The link allows for metastability-free, low-latency, high-throughput communication by slight adju…

cs.OH2020★ 1 cited

A Faithful Binary Circuit Model with Adversarial Noise

Matthias Függer, Jürgen Maier, Robert Najvirt +2

Accurate delay models are important for static and dynamic timing analysis of digital circuits, and mandatory for formal verification. However, Függer et al. [IEEE TC 2016] proved…

cs.DC2020

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…

math.PR2020

Distributed Computation with Continual Population Growth

Da-Jung Cho, Matthias Függer, Corbin Hopper +3

Computing with synthetically engineered bacteria is a vibrant and active field with numerous applications in bio-production, bio-sensing, and medicine. Motivated by the lack of rob…

cs.DC2019

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…

cs.DC2017

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…

cs.DC2016

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…

cs.DC2015★ 1 cited

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…

eess.SY2015

A Proof of the Convergence of the Hegselmann-Krause Dynamics on the Circle

Bernadette Charron-Bost, Matthias Függer, Thomas Nowak

In this note, we give a complete proof that Hegselmann-Krause systems converge on the circle following the proof strategy developed by Hegarty, Martinsson, and Wedin.

cs.DC2014★ 6 cited

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…

cs.OH2014★ 2 cited

Faithful Glitch Propagation in Binary Circuit Models

Matthias Függer, Robert Najvirt, Thomas Nowak +1

Modern digital circuit design relies on fast digital timing simulation tools and, hence, on accurate binary-valued circuit models that faithfully model signal propagation, even thr…

cs.DM2012★ 9 cited

New Transience Bounds for Long Walks

Bernadette Charron-Bost, Matthias Függer, Thomas Nowak

Linear max-plus systems describe the behavior of a large variety of complex systems. It is known that these systems show a periodic behavior after an initial transient phase. Asses…

cs.DC2012

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…

cs.DM2011★ 7 cited

On the Transience of Linear Max-Plus Dynamical Systems

Bernadette Charron-Bost, Matthias Függer, Thomas Nowak

We study the transients of linear max-plus dynamical systems. For that, we consider for each irreducible max-plus matrix A, the weighted graph G(A) such that A is the adjacency mat…

cs.DC2011★ 5 cited

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…