research
∙
04/05/2023
Topological Characterization of Consensus Solvability in Directed Dynamic Networks
Consensus is one of the most fundamental problems in distributed computi...
share
research
∙
04/01/2023
A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems
Existing protocols for byzantine fault tolerant distributed systems usua...
research
∙
01/10/2023
A Digital Delay Model Supporting Large Adversarial Delay Variations
Dynamic digital timing analysis is a promising alternative to analog sim...
research
∙
11/19/2022
An Accurate Hybrid Delay Model for Multi-Input Gates
In order to facilitate the analysis of timing relations between individu...
research
∙
08/17/2022
On Specifications and Proofs of Timed Circuits
Given a discrete-state continuous-time reactive system, like a digital c...
research
∙
02/24/2022
Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries
Consensus is a most fundamental task in distributed computing. This pape...
research
∙
11/16/2021
A Simple Hybrid Model for Accurate Delay Modeling of a Multi-Input Gate
Faithfully representing small gate delay variations caused by input swit...
research
∙
09/03/2021
Continuous Tasks and the Chromatic Simplicial Approximation Theorem
The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy ...
research
∙
04/22/2021
A Composable Glitch-Aware Delay Model
We introduce the Composable Involution Delay Model (CIDM) for fast and a...
research
∙
11/02/2020
The Persistence of False Memory: Brain in a Vat Despite Perfect Clocks
Recently, a detailed epistemic reasoning framework for multi-agent syste...
research
∙
06/15/2020
A Faithful Binary Circuit Model with Adversarial Noise
Accurate delay models are important for static and dynamic timing analys...
research
∙
07/22/2019
Causality and Epistemic Reasoning in Byzantine Multi-Agent Systems
Causality is an important concept both for proving impossibility results...
research
∙
05/23/2019
