Abstract
The aim of this work is to define a useful concurrency measure, easy to implement and whose computation complexity allows the study of real examples. We extend the measure introduced in [BT87] to a probabilistie one, by means of a natural translation of the synchronized automata of Arnold-Nivat's model to Markov chains: the computation of the measure uses the concept of average time before absorbtion. Some examples including the mutual exclusion are detailed.
Cite
CITATION STYLE
Geniet, D., Schott, R., & Thimonier, L. (1990). A Markovian concurrency measure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 431 LNCS, pp. 177–190). Springer Verlag. https://doi.org/10.1007/3-540-52590-4_48
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
