Geometric Models of Concurrent Computations

Abstract : Since the 90s, geometric models have been introduced for concurrent programs. In those, a point corresponds to a state, a path to an execution and a deformation of a path to an equivalence between executions. They are useful to analyze programs because they provide a convenient representation of their state space, on which one can use some of the well-developed tools and invariants from geometry (curvature, homology, etc.). Conversely, the study of the spaces arising as models brings new problems of purely geometric nature: most importantly, they are naturally equipped with a direction (of time), which requires adapting most usual notions. In this habilitation thesis, we present such models that we have developed and studied, as well as general techniques to do so and the results they have allowed us to obtain. Those have been applied to various notion of "concurrent programs": programs in an imperative language extended with a parallel construction and resources, but also distributed protocols, version control systems, or rewriting systems. The “geometric models” we have studied for those are also of various nature: precubical sets, directed topological spaces, generalized metric spaces, or polygraphs.
Complete list of metadatas

Cited literature [206 references]  Display  Hide  Download

https://hal.inria.fr/tel-01783442
Contributor : Samuel Mimram <>
Submitted on : Wednesday, May 2, 2018 - 1:47:53 PM
Last modification on : Thursday, June 13, 2019 - 9:24:02 AM
Long-term archiving on : Monday, September 24, 2018 - 5:11:43 PM

File

mimram-hdr.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : tel-01783442, version 1

Citation

Samuel Mimram. Geometric Models of Concurrent Computations. Logic in Computer Science [cs.LO]. Université Paris 7, 2016. ⟨tel-01783442⟩

Share

Metrics

Record views

203

Files downloads

103