We are receiving Emmanuel Godard from Université Aix-Marseille. He will give a talk on April 24th at 10:00 AM in room Aurigny (D165, orange level).
Title: Combinatorial Aspects of Message Adversaries
Abstract: “Message adversaries” denotes a synchronous distributed model. The term was coined recently [Afek & Gafni 2013], but the model was actually introduced long time ago in many contexts (from system with message omissions to dynamic networks). In the message passing context, it corresponds to the mobile omissions model [Santoro & Widmayer 89] but also the more recent “Heard-of” model [Charron-Bost & Schiper 09]. There are also equivalences (from a computability point of view) with shared memory models, like the “iterated snapshot” model [Borowsky & Gafni 93]. Some message adversaries, with specific restrictions, are also proved to be equivalent to standard asynchronous shared memory models [Raynal & Stainer 13].
We present results we have obtained considering message adversaries in the more general (combinatorial) way. We also discuss how a combinatorial approach might help investigate the current challenges in distributed computability.