APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS

DOI10.1142/S0129054108005796zbMath1156.68493OpenAlexW2081034775MaRDI QIDQ3538847

Roberto Radicioni, Alberto Bertoni

Publication date: 24 November 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108005796

zbMATH Keywords

concurrent systemsuniform random generation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Uniform and Bernoulli measures on the boundary of trace monoids

Cites Work

• Computing the average parallelism in trace monoids.
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Concurrency measure in commutation monoids
• Combinatorial problems of commutation and rearrangements
• Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard
• On the Estimation of the Throughput for a Class of Stochastic Resources Sharing Systems
• Dynamics of synchronized parallel systems
• Performance evaluation of (max,+) automata

This page was built for publication: APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS