scientific article; zbMATH DE number 1504638

MaRDI QIDQ4502595zbMATH OpenFDO

Authors Nasser Saheb, A. Zemmari

Publication date 1 April 2001

zbMATH Keywords

approximation algorithmconcurrent processesMarkov chainpartial commutative monoidrandom walk

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational methods in Markov chains (60J22) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Concurrency measure in commutation monoids
• Two optimal parallel algorithms on the commutation class of a word
• scientific article; zbMATH DE number 3972221
• Some properties of commutation in free partially commutative monoids
• A decision procedure on partially commutative free monoids

Cited in

(5)

• Complexity results on the conjugacy problem for monoids
• Computing the average parallelism in trace monoids.
• Concurrency measure in commutation monoids
• Two optimal parallel algorithms on the commutation class of a word
• 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 Q4502595)