no. 4
A Markovian concurrency measure
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 4, pp. 295-304 
@article{ITA_1996__30_4_295_0,
     author = {Geniet, Dominique and Schott, Ren\'e and Thimonier, Lo\"ys},
     title = {A {Markovian} concurrency measure},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {295--304},
     year = {1996},
     publisher = {EDP Sciences},
     volume = {30},
     number = {4},
     mrnumber = {1427936},
     zbl = {0867.68049},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1996__30_4_295_0/}
}
TY  - JOUR
AU  - Geniet, Dominique
AU  - Schott, René
AU  - Thimonier, Loÿs
TI  - A Markovian concurrency measure
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1996
SP  - 295
EP  - 304
VL  - 30
IS  - 4
PB  - EDP Sciences
UR  - https://www.numdam.org/item/ITA_1996__30_4_295_0/
LA  - en
ID  - ITA_1996__30_4_295_0
ER  - 
%0 Journal Article
%A Geniet, Dominique
%A Schott, René
%A Thimonier, Loÿs
%T A Markovian concurrency measure
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1996
%P 295-304
%V 30
%N 4
%I EDP Sciences
%U https://www.numdam.org/item/ITA_1996__30_4_295_0/
%G en
%F ITA_1996__30_4_295_0
Geniet, Dominique; Schott, René; Thimonier, Loÿs. A Markovian concurrency measure. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 4, pp. 295-304. https://www.numdam.org/item/ITA_1996__30_4_295_0/

1. A. Arnold, Finite transition System, Prentice Hall, 1994. | Zbl

2. A. Arnold and M. Nivat, Comportements de processus L.I.T.P., Rapport No. 82-12, Univ. Paris, France.

3. J. Beauquier, B. Bérard and L. Thimonier, On a concurrency measure, LRI Orsay Techn. Report No. 288, 1986, and 2nd I.S.C.I.S. proc, Istanbul 1987, Turkey, pp. 211-225.

4. J. M. Autebert, Langages algébriques, Masson, 1987. | MR

5. B. Charron-Bost, Mesures de la concurrence et du parallélisme des calculs répartis, Thèse, Univ. Paris-VII, France, 1989.

6. S. Eilenberg, Automata, languages and machines, Academic Press, 1976.

7. W. Feller, An introduction to probability theory, Addison-Wesley, 1968.

8. P. Flajolet, Analyse d'algorithmes de manipulation d'arbres et de fichiers, B.U.R.O. Cahiers, 34-35, 1981.

9. J. Françon, B. Randrianarimanana and R. Schott, Dynamic data structures with finite population: a combinatorial analysis, F.C.T'89 proc, L.N.C.S. 380, pp. 162-174. | Zbl | MR

10. J. Françon, A quantitative approach of mutual exclusion, R.A.I.R.O. Theoretical Informatics and Applications, No, 20, 1986, pp. 275-289. | Zbl | MR | Numdam

11. D. Geniet and L. Thimonier, Using generating functions to compute concurrency, F.C.T.'89 proc, L.N.C.S., 380, pp. 185-196. | Zbl | MR

12. D. Geniet, Automaf: un système de construction d'automates synchronisés et de calcul de mesure du parallélisme, Thesis, Univ. Paris-XI, France, 1989.

13. G. Louchard, B. Randrianarimanana and R. Schott, Dynamic algorithms in D. E. Knuth's model: a probabilistic analysis, I.C.A.L.P.'89 proc., L.N.C.S., 372, pp. 521-533, Stresa, Italy, 1989, full version in T.C.5., 93, 1992, pp. 210-225. | Zbl | MR

14. C. Pair, M. Mohr and R. Schott, Construire les algorithmes, Dunod Informatique, 1988.