Uniform and Bernoulli measures on the boundary of trace monoids

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.
Type de document :
Article dans une revue
Journal of Combinatorial Theory, Series A, Elsevier, 2015, 135, pp.201-236. 〈10.1016/j.jcta.2015.05.003〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01158021
Contributeur : Samy Abbes <>
Soumis le : vendredi 29 mai 2015 - 11:51:21
Dernière modification le : vendredi 14 décembre 2018 - 01:25:24

Lien texte intégral

Identifiants

Collections

Citation

Samy Abbes, Jean Mairesse. Uniform and Bernoulli measures on the boundary of trace monoids. Journal of Combinatorial Theory, Series A, Elsevier, 2015, 135, pp.201-236. 〈10.1016/j.jcta.2015.05.003〉. 〈hal-01158021〉

Partager

Métriques

Consultations de la notice

168