A commutation system consists of an alphabet A and a symmetric and irreflexive relation R on A. A pair (a,b) from R represents commutation (or concurrency) of the letters a and b. The author defines a degree which measures the concurrency of each word w, and shows that the degree tends with probability 1 to a fixed limit determined by the commutation system when the length of a randomly chosen word increases.
Recommendations
Cites work
- Combinatorial problems of commutation and rearrangements
- scientific article; zbMATH DE number 3961017 (Why is no real title available?)
- scientific article; zbMATH DE number 3972221 (Why is no real title available?)
- scientific article; zbMATH DE number 4002104 (Why is no real title available?)
- scientific article; zbMATH DE number 3216769 (Why is no real title available?)
- scientific article; zbMATH DE number 3255204 (Why is no real title available?)
- Maximal serializability of iterated transactions
- Une approche quantitative de l'exclusion mutuelle
Cited in
(9)- Computing the average parallelism in trace monoids.
- A cut-invariant law of large numbers for random heaps
- On the average Cartier-Foata height of traces
- Modelling Concurrency with Quotient Monoids
- APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS
- Compression of Words Over a Partially Commutative Alphabet
- scientific article; zbMATH DE number 1504638 (Why is no real title available?)
- Uniform and Bernoulli measures on the boundary of trace monoids
- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids
This page was built for publication: Concurrency measure in commutation monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824702)
