Concept

Unbounded nondeterminism

Publications associées (21)

Collective motion in a sheet of microswimmers

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 ...

Berlin2024

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

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

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

A Rule Synthesis Algorithm for Programmable Stochastic Self-Assembly of Robotic Modules

Alcherio Martinoli, Bahar Haghighat

Programmable self-assembly of modular robots offers promising means for structure formation at different scales. Rule-based approaches have been previously employed for distributed control of stochastic self-assembly processes. The assembly rate in the pro ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Parameterized Systems in BIP: Design and Model Checking

Joseph Sifakis, Simon Bliudze, 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

Linearizability Is Not Always a Safety Property

Rachid Guerraoui, Eric Ruppert

We show that, in contrast to the general belief in the distributed computing community, linearizability, the celebrated consistency property, is not always a safety property. More specifically, we give an object for which it is possible to have an infinite ...

Springer International Publishing2014

Eliminating unscalable communication in transaction processing

Anastasia Ailamaki, Frederick Ryan Johnson, Ippokratis Pandis

Multicore hardware demands software parallelism. Transaction processing workloads typically exhibit high concurrency, and, thus, provide ample opportunities for parallel execution. Unfortunately, because of the characteristics of the application, transacti ...

Springer Verlag2014

Solid-State Storage and Work Sharing for Efficient Scaleup Data Analytics

Manoussos Gavriil Athanassoulis

Today, managing, storing and analyzing data continuously in order to gain additional insight is becoming commonplace. Data analytics engines have been traditionally optimized for read-only queries assuming that the main data reside on mechanical disks. The ...

EPFL2014

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

Thomas Keller, Wendel Michael Sebastian

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, Vasu Singh

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

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search