Skip to Main content Skip to Navigation
Conference papers

Statistical Analysis of Non-Deterministic Fork-Join Processes

Abstract : 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 increasing labelling. Beyond the theory, our goal is to develop algorithms and tools for the statistical analysis of the process behaviours. In the second part we develop and experiment two efficient random sampling algorithms serving as basic building blocks for state-space exploration. One is a uniform random sampler of bounded executions, providing a good default exploration strategy, and the other is a uniform sampler of execution prefixes allowing to bias the exploration in a controlled manner. The fundamental characteristic of these algorithms is that they work on the control graph of the programs and do not require the construction of its state-space, thus providing a way to tackle the infamous state explosion problem.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-02659801
Contributor : Martin Pépin <>
Submitted on : Wednesday, October 21, 2020 - 3:43:07 PM
Last modification on : Tuesday, March 23, 2021 - 9:28:02 AM

File

ictac2020.pdf
Files produced by the author(s)

Identifiers

Citation

Antoine Genitrini, Martin Pépin, Frédéric Peschanski. Statistical Analysis of Non-Deterministic Fork-Join Processes. Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Nov 2020, Macau, China. pp.83-102, ⟨10.1007/978-3-030-64276-1_5⟩. ⟨hal-02659801v2⟩

Share

Metrics

Record views

73

Files downloads

77