A Markovian Concurrency Measure

act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the behaviour of the processes and is in addition easy to compute with a symbolic manipulator like Maple (this is an improvement over a previous measure [3] whose computation appears to be expensive.

• Type: Conference
• Year: 1990
• Where: CAAP
• Authors: Dominique Geniet, René Schott, Loÿs Thimonier
• Keywords: CAAP 1990, Concurrency Measure, Markov Chains, Symbolic Manipulator, Theoretical Computer Science