Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Godard, Emmanuel"'
Autor:
Coutouly, Yannis, Godard, Emmanuel
The Iterated Immediate Snapshot model (IIS) is a central model in the message adversary setting. We consider general message adversaries whose executions are arbitrary subsets of the executions of the IIS message adversary. We present a new topologic
Externí odkaz:
http://arxiv.org/abs/2304.05486
Autor:
Godard, Emmanuel
Publikováno v:
Theory of Computing Systems volume 63 pages 326-343 (2019)
We consider snap-stabilizing algorithms in anonymous networks. Self-stabilizing algorithms are well known fault tolerant algorithms : a self-stabilizing algorithm will eventually recover from arbitrary transient faults. On the other hand, an algorith
Externí odkaz:
http://arxiv.org/abs/2203.06012
Autor:
Godard, Emmanuel, Perdereau, Eloi
Publikováno v:
Math. Struct. Comp. Sci. 30 (2020) 1089-1113
We consider the well known Coordinated Attack Problem, where two generals have to decide on a common attack, when their messengers can be captured by the enemy. Informally, this problem represents the difficulties to agree in the presence of communic
Externí odkaz:
http://arxiv.org/abs/2103.10816
Anonymous shared memory is a memory in which processes use different names for the same shared read/write register. As an example, a shared register named $A$ by a process $p$ and a shared register named $B$ by another process $q$ can correspond to t
Externí odkaz:
http://arxiv.org/abs/1903.12204
We investigate the exploration and mapping of anonymous graphs by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halt after the exploration except if the graph is a tree. We the
Externí odkaz:
http://arxiv.org/abs/1604.05915
We investigate the exploration of networks by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halts after the exploration except if the graph is a tree. We therefore endow the ag
Externí odkaz:
http://arxiv.org/abs/1505.00599
Publikováno v:
In Theoretical Computer Science 6 October 2020 836:110-123
In infrastructure-less highly dynamic networks, computing and performing even basic tasks (such as routing and broadcasting) is a very challenging activity due to the fact that connectivity does not necessarily hold, and the network may actually be d
Externí odkaz:
http://arxiv.org/abs/1205.1975
Autor:
Godard, Emmanuel, Peters, Joseph
We compare the solvability of the Consensus and Broadcast problems in synchronous communication networks in which the delivery of messages is not reliable. The failure model is the mobile omission faults model. During each round, some messages can be
Externí odkaz:
http://arxiv.org/abs/1106.3579
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the problem of the detection of the termination of local computations. We define
Externí odkaz:
http://arxiv.org/abs/1001.2785