Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Unbounded nondeterminism

Publications associées (8)

Collective motion in a sheet of microswimmers

Viktor Skultéty

Self-propelled particles such as bacteria or algae swimming through a fluid are non-equilibrium systems where particle motility breaks microscopic detailed balance, often resulting in large-scale collective motion. Previous theoretical work has identified ...

Nature Portfolio2024

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Rachid Guerraoui, Vincent Gramoli, Seth Gilbert, Jovan Komatovic, Manuel José Ribeiro Vidigueira, Pierre Philippe Civit

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

2023

Local Nondeterminism and Local Times of the Stochastic Wave Equation Driven by Fractional-Colored Noise

Cheuk Yin Lee

We investigate the existence and regularity of the local times of the solution to a linear system of stochastic wave equations driven by a Gaussian noise that is fractional in time and colored in space. Using Fourier analytic methods, we establish strong l ...

SPRINGER BIRKHAUSER2022

Parameterized Systems in BIP: Design and Model Checking

Simon Bliudze, Joseph Sifakis, Qiang Wang

BIP is a component-based framework for system design that has important industrial applications. BIP is built on three pillars: behavior, interaction, and priority. In this paper, we introduce first-order interaction logic (FOIL) that extends BIP to system ...

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik2016

Load response due to local and global indeterminacies of FRP-deck bridges

Thomas Keller

In a cellular FRP deck-on-beam bridge, the deck's load response is influenced by the cellular frame's local indeterminacy and by the global indeterminacy due to multiple beams at each support. Thus, the stiffness distributions for both levels of indetermin ...

2012

Model checking transactional memories

Rachid Guerraoui

Model checking transactional memories (TMs) is difficult because of the unbounded number, length, and delay of concurrent transactions, as well as the unbounded size of the memory. We show that, under certain conditions satisfied by most TMs we know of, th ...

Springer Verlag2010

Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions

Maria-Emanuela-Canini Mateescu

We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds the number of steps that one process gets ahead of other processes; this all ...

Springer2008

A General Characterization of Indulgence (Invited Paper)

Rachid Guerraoui

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and scheduling failures. In particular, no process can take any irrevoca ...

2006