scientific article; zbMATH DE number 2086409

MaRDI QIDQ4736864zbMATH OpenFDO

Authors Daniel Krob, Jean Mairesse, I. C. Michos

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850477.htm

Mathematics Subject Classification ID

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

Recommendations

• Computing the average parallelism in trace monoids.
• APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS
• SOME LIMIT DISTRIBUTIONS IN ANALYSIS OF ALGORITHMS FOR PROBLEMS ON TRACE LANGUAGES
• scientific article; zbMATH DE number 1333602
• scientific article; zbMATH DE number 4116001

Cited in

(9)

• Computing the average parallelism in trace monoids.
• Synchronization of Bernoulli sequences on shared letters
• A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
• scientific article; zbMATH DE number 5953970 (Why is no real title available?)
• APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS
• scientific article; zbMATH DE number 2040903 (Why is no real title available?)
• Uniform and Bernoulli measures on the boundary of trace monoids
• Parallelism of stable traces
• Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736864)