4 citations · 6 across the 5 of their papers we have counts for
6 papers
Uniform generation of infinite concurrent runs: the case of trace monoids
Samy Abbes, Vincent Jugé
We introduce an algorithm for the uniform generation of infinite runs in concurrent systems under a partial order probabilistic semantics. We work with trace monoids as concurrency…
Toward uniform random generation in 1-safe Petri nets
Samy Abbes
We study the notion of uniform measure on the space of infinite executions of a 1-safe Petri net. Here, executions of 1-safe Petri nets are understood up to commutation of concurre…
Uniform generation in trace monoids
Samy Abbes, Jean Mairesse
We consider the problem of random uniform generation of traces (the elements of a free partially commutative monoid) in light of the uniform measure on the boundary at infinity of…
Representation of traces by vectors of words
Samy Abbes
We show that every trace monoid is isomorphic to a sub-monoid of a monoid of word vectors. It provides a concrete representation of the elements of a trace monoid as processes asso…
A Graded Möbius transform and its harmonic interpretation
Samy Abbes
We give a graded version of the Möbius inversion formula in the framework of trace monoids. The formula is based on a graded version of the Möbius transform, related to the notion…
A cut-invariant law of large numbers for random heaps
Samy Abbes
Heap monoids equipped with Bernoulli measures are a model of probabilistic asynchronous systems. We introduce in this framework the notion of asynchronous stopping time, which is a…