Uniform and Bernoulli measures on the boundary of trace monoids - Archive ouverte HAL Access content directly
Journal Articles Journal of Combinatorial Theory, Series A Year : 2015

Uniform and Bernoulli measures on the boundary of trace monoids

(1) , (2)
1
2
Samy Abbes
Jean Mairesse

Abstract

Trace monoids and heaps of pieces appear in various contexts in combinatorics. They also constitute a model used in computer science to describe the executions of asynchronous systems. The design of a natural probabilistic layer on top of the model has been a long standing challenge. The difficulty comes from the presence of commuting pieces and from the absence of a global clock. In this paper, we introduce and study the class of Bernoulli probability measures that we claim to be the simplest adequate probability measures on infinite traces. For this, we strongly rely on the theory of trace combinatorics with the Möbius polynomial in the key role. These new measures provide a theoretical foundation for the probabilistic study of concurrent systems.

Dates and versions

hal-01158021 , version 1 (29-05-2015)

Identifiers

Cite

Samy Abbes, Jean Mairesse. Uniform and Bernoulli measures on the boundary of trace monoids. Journal of Combinatorial Theory, Series A, 2015, 135, pp.201-236. ⟨10.1016/j.jcta.2015.05.003⟩. ⟨hal-01158021⟩
118 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More