Publications related to Process calculus

Divide-and-conquer one-step simulator for the generation of synthetic households

This paper presents a novel simulation approach for generating synthetic households, addressing several literature gaps from the methodological viewpoint. The generation of hierarchical datasets such as complete households is challenging since it must guar ...

2023

Dynamic Byzantine Reliable Broadcast

Rachid Guerraoui, Jovan Komatovic, Dragos-Adrian Seredinschi, Andrei Tonkikh

Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a co ...

Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik2021

Mechanical and Morphological Properties of Lignin-Based Thermosets

Cédric Terrier

The need for renewable alternatives for fossil-based aromatic material constituents is evident for a more sustainable society. Lignin is the largest source of naturally occurring aromatic compounds but has mainly been considered as waste material or energy ...

2020

Brief Announcement: Persistent Multi-Word Compare-and-Swap

Matej Pavlovic

This brief announcement presents a fundamental concurrent primitive for persistent memory - a persistent atomic multi-word compare-and-swap (PMCAS). We present a novel algorithm carefully crafted to ensure that atomic updates to a multitude of words modifi ...

ASSOC COMPUTING MACHINERY2018

A Multi-Core Reconfigurable Architecture for Ultra-Low Power Bio-Signal Analysis

David Atienza Alonso, Giovanni Ansaloni, Ruben Braojos Lopez, Soumya Subhra Basu, Loris Gérard Duch

This paper introduces a novel computing architecture devoted to the ultra-low power analysis of multiple bio-signals. Its structure comprises several processors interfaced with a shared acceleration resource, implemented as a Coarse Grained Reconfigurable ...

2016

Economical Analysis of a Pressurized Fluid-Based Process Applied for Phytochemicals Recovery in a Sustainable Biorefinery Concept for Brazilian Ginseng Roots

François Maréchal

A growing number of technologies are being developed in order to produce different high added value products, such as phytochemicals, ethanol and other chemicals from biomass, representing an important trend that needs to be evaluated. The use of pressuriz ...

Aidic Servizi Srl2016

The Single European Sky gridlock: A difficult 10 year reform process

Matthias Finger

This article presents the gradual liberalization of European air transport, especially its most recent problems in the case of the Single European Sky (SES). Indeed, after successfully liberalizing airlines and, to a certain extent, airports, the European ...

Elsevier2014

Execution Synthesis: A Technique for Automating the Debugging of Software

Cristian Zamfir

Debugging real systems is hard, requires deep knowledge of the target code, and is time-consuming. Bug reports rarely provide sufficient information for debugging, thus forcing developers to turn into detectives searching for an explanation of how the prog ...

EPFL2013

Geostatistics of Dependent and Asymptotically Independent Extremes

Anthony Christopher Davison, Emeric Rolland Georges Thibaud, Raphaël Huser

Spatial modeling of rare events has obvious applications in the environmental sciences and is crucial when assessing the effects of catastrophic events (such as heatwaves or widespread flooding) on food security and on the sustainability of societal infras ...

Springer Heidelberg2013

Towards a Theory of Glue

Simon Bliudze

We propose and study the notions of behaviour type and composition operator making a first step towards the definition of a formal framework for studying behaviour composition in a setting sufficiently general to provide insight into how the component-base ...

2012

Audio-Visual Object Extraction using Graph Cuts

Pierre Vandergheynst, Anna Llagostera Casanovas

We propose a novel method to automatically extract the audio-visual objects that are present in a scene. First, the synchrony between related events in audio and video channels is exploited to identify the possible locations of the sound sources. Video reg ...

Institute of Electrical and Electronics Engineers2012

Formal Analysis of SystemC Designs in Process Algebra

Hossein Hojjat

SystemC is an IEEE standard system-level language used in hardware/software co-design and has been widely adopted in the industry. This paper describes a formal approach to verifying SystemC designs by providing a mapping to the process algebra mCRL2. Our ...

2011

Formalisms for Specifying Markovian Population Models

Barbara Jobstmann, Verena Wolf

We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages -matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency

André Schiper, Martin Hutle, Zarko Milosevic

The paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes authenticated Byzantine faults, where messages can be signed by the sending process (with the assumption tha ...

Springer-Verlag2009

Equivalences and calculi for formal verification of cryptographic protocols

Johannes Borgström

Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptograp ...

EPFL2008

Theory and tool support for the formal verification of cryptographic protocols

Sébastien Briais

Cryptographic protocols are an essential component of network communications. Despite their relatively small size compared to other distributed algorithms, they are known to be error-prone. This is due to the obligation to behave robustly in the context of ...

EPFL2008

Sharing is Harder than Agreeing

Rachid Guerraoui

One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of

n

processes that communicate through shared memory registers, to solve the set agreement problem where the processes need to deci ...

2008

Abstractions for asynchronous distributed computing with malicious players

Marko Vukolic

In modern distributed systems, failures are the norm rather than the exception. In many cases, these failures are not benign. Settings such as the Internet might incur malicious (also called Byzantine or arbitrary) behavior and asynchrony. As a result, and ...

EPFL2008

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

Designing Application-Specific Networks on Chips with Floorplan Information

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali, Federico Angiolini

With increasing communication demands of processor and memory cores in Systems on Chips (SoCs), scalable Networks on Chips (NoCs) are needed to interconnect the cores. For the use of NoCs to be feasible in today’s industrial designs, a custom-tailored, app ...

2006