Publication

Unreliable Failure Detectors via Operational Semantics

Related publications (70)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Schema matching for structured document transformations

Aïda Boukottaya

This dissertation studies structured document content reuse problem. In structured document content reuse, a document (or a part of document) structured under one schema must be restructured and translated into an instance of a different schema. Thus, a no ...

EPFL2004

Unreliable Failure Detectors via Operational Semantics

Rachele Fuzzati

The concept of Unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony into asynchronous systems. Various kinds of such failure detectors have been identified ...

2003

Iplt-image processing library and toolkit for the electron microscopy community

Henning Paul-Julius Stahlberg, Andreas Engel

We present the foundation for establishing a modular, collaborative, integrated, open-source architecture for image processing of electron microscopy images, named iplt. It is designed around object oriented paradigms and implemented using the programming ...

Elsevier BV2003

Modeling Consensus in a Process Calculus

Rachele Fuzzati, Massimo Merro

We give a process calculus model that formalizes a well known algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failure detectors (Diamond S); we use our model to formally prove that the algorithm satisf ...

2003

Modeling Consensus in a Process Calculus

Rachele Fuzzati, Massimo Merro

We give a process calculus model that formalizes a well-known algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failure detectors; we use our model to formally prove that the algorithm satisfies its spec ...

2003

An Equational Theory for Transactions

Rachid Guerraoui, Martin Odersky, Vincent Cremet

Transactions are commonly described as being ACID: All-or-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID properties have never been given a precise semantics in a way that disentangles each pr ...

2003

An Equational Theory for Transactions

Rachid Guerraoui, Martin Odersky, Vincent Cremet

2003

Towards the Formal Integration of Two Upcoming Standards: IEC61970 and IEC61850

Otto Preiss, Christian Frei, Tatjana Kostic

AbstractThe constant demand for a better integration of utility applications and systems provokes the question on the compatibility of standards that were, and still are, developed for these individual utility disciplines. This paper discusses the need for ...

2003

Semantics of Protocol Modules Composition and Interaction

André Schiper, Sergio Mena

This paper studies the semantics of protocol modules composition and interaction in configurable communication systems. We present a semantic model describing the x-kernel, Cactus and Appia --- three frameworks that are used for implementing modular system ...

2002

Semantics of Protocol Modules Composition and Interaction

André Schiper, Sergio Mena

This paper studies the semantics of protocol modules composition and interaction in configurable communication systems. We present a semantic model describing Cactus and Appia -- two frameworks that are used for implementing modular systems. The model cove ...

Springer2002