Concurrency measure in commutation monoids

DOI10.1016/0166-218X(92)90287-KzbMath0683.20047MaRDI QIDQ1824702

Nasser Saheb

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

degreeconcurrencywordalphabetcommutation system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (6)

A cut-invariant law of large numbers for random heaps ⋮ Computing the average parallelism in trace monoids. ⋮ APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS ⋮ Uniform and Bernoulli measures on the boundary of trace monoids ⋮ Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids ⋮ On the average Cartier-Foata height of traces

Cites Work

• Maximal serializability of iterated transactions
• Combinatorial problems of commutation and rearrangements
• Une approche quantitative de l'exclusion mutuelle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concurrency measure in commutation monoids