Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency

Autor: OLivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski

Publikováno v: Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 3, Computational..., Iss Special issues (2021)

In this paper we address the problem of understanding Concurrency Theory from a combinatorial point of view. We are interested in quantitative results and algorithmic tools to refine our understanding of the classical combinatorial explosion phenomen

Externí odkaz: https://doaj.org/article/d3fc0905b1b64835b81ebe8ec96db88d

Enumeration and Random Generation of Concurrent Computations

Autor: Olivier Bodini, Antoine Genitrini, Frédéric Peschanski

Publikováno v: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)

In this paper, we study the shuffle operator on concurrent processes (represented as trees) using analytic combinatorics tools. As a first result, we show that the mean width of shuffle trees is exponentially smaller than the worst case upper-bound.

Externí odkaz: https://doaj.org/article/28bdb1f8133f48cc893be9bcf3afc641

A Combinatorial Study of Async/Await Processes

Autor: Matthieu Dien, Antoine Genitrini, Frédéric Peschanski

Publikováno v: Lecture Notes in Computer Science ISBN: 9783031177149

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cf32aedd6a49054c7a1714abb8adf8c3
https://doi.org/10.1007/978-3-031-17715-6_12

A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space

Autor: Antoine Genitrini, Martin Pépin, Frédéric Peschanski

We study concurrent programs with non-deterministic choice, loops and a fork-join style of coordination under the lens of combinatorics. As a starting point, we interpret these programs as combinatorial structures. We propose a framework, based on an

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56fba3f2a0d5675e93d8d62d2674af9a
https://hal.sorbonne-universite.fr/hal-03201618/document

Statistical Analysis of Non-Deterministic Fork-Join Processes

Autor: Martin Pépin, Frédéric Peschanski, Antoine Genitrini

Publikováno v: Theoretical Aspects of Computing-ICTAC 2020-17th International Colloquium
Theoretical Aspects of Computing-ICTAC 2020-17th International Colloquium, Nov 2020, Macau, China. pp.83-102, ⟨10.1007/978-3-030-64276-1_5⟩
Theoretical Aspects of Computing – ICTAC 2020 ISBN: 9783030642754
ICTAC

International audience; We study the combinatorial structure of the state-space of non-deterministic fork-join processes. As a first step we establish a link between concurrent programs and a class of combinatorial structures based on the notion of i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3dc70261fff5c4a65ec1ef6a8923ae1f
https://hal.sorbonne-universite.fr/hal-02659801v2/file/ictac2020.pdf