Uniform and Bernoulli measures on the boundary of trace monoids

TL;DR

This paper introduces Bernoulli probability measures on infinite traces of trace monoids, providing a foundational probabilistic framework for analyzing concurrent systems in computer science.

Contribution

It defines and studies Bernoulli measures on trace monoids, leveraging trace combinatorics and Möbius polynomials to establish a natural probabilistic model for asynchronous system executions.

Findings

Introduction of Bernoulli measures on infinite traces

Use of Möbius polynomial in measure construction

Provides a theoretical foundation for probabilistic concurrent system analysis

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\"obius polynomial in the key role. These new measures provide a theoretical foundation for the probabilistic study of concurrent systems.