Skip to Main content Skip to Navigation

Geometric semantics for asynchronous computability

Abstract : The field of fault-tolerant protocols studies which concurrent tasks are solvable in various computational models where processes may crash. To answer these questions, powerful mathematical tools based on combinatorial topology have been developed since the 1990’s. In this approach, the task that we want to solve, and the protocol that we use to solve it, are both modeled using chromatic simplicial complexes. By definition, a protocol solves a task when there exists a particular simplicial map between those complexes.In this thesis we study these geometric methods from the point of view of semantics. Our first goal is to ground this abstract definition of task solvability on a more concrete one, based on interleavings of execution traces. We investigate various notions of specification for concurrent objects, in order to define a general setting for solving concurrent tasks using shared objects. We then show how the topological definition of task solvability can be derived from it.In the second part of the thesis, we show that chromatic simplicial complexes can actually be used to interpret epistemic logic formulas. This allows us to understand the topological proofs of task unsolvability in terms of the amount of knowledge that the processes should acquire in order to solve a task.Finally, we present a few preliminary links with the directed space semantics for concurrent programs. We show how chromatic subdivisions of a simplex can be recovered by considering combinatorial notions of directed paths.
Complete list of metadatas

Cited literature [137 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Monday, January 20, 2020 - 8:56:09 AM
Last modification on : Sunday, February 2, 2020 - 8:09:07 PM
Long-term archiving on: : Tuesday, April 21, 2020 - 2:20:09 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02445180, version 1



Jérémy Ledent. Geometric semantics for asynchronous computability. Logic in Computer Science [cs.LO]. Université Paris-Saclay, 2019. English. ⟨NNT : 2019SACLX099⟩. ⟨tel-02445180⟩



Record views


Files downloads