Enumeration and Random Generation of Concurrent Computations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

Enumeration and Random Generation of Concurrent Computations


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. We also study the expected size (in total number of nodes) of shuffle trees. We notice, rather unexpectedly, that only a small ratio of all nodes do not belong to the last two levels. We also provide a precise characterization of what ``exponential growth'' means in the case of the shuffle on trees. Two practical outcomes of our quantitative study are presented: (1) a linear-time algorithm to compute the probability of a concurrent run prefix, and (2) an efficient algorithm for uniform random generation of concurrent runs.
Fichier principal
Vignette du fichier
dmAQ0108.pdf (369.72 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01197236 , version 1 (11-09-2015)



Olivier Bodini, Antoine Genitrini, Frédéric Peschanski. Enumeration and Random Generation of Concurrent Computations. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), Jun 2012, Montreal, Canada. pp.83-96, ⟨10.46298/dmtcs.2986⟩. ⟨hal-01197236⟩
337 View
491 Download



Gmail Facebook X LinkedIn More