A Markovian concurrency measure

Dominique Geniet; René Schott; Loÿs Thimonier

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1996)

  • Volume: 30, Issue: 4, page 295-304
  • ISSN: 0988-3754

How to cite

top

Geniet, Dominique, Schott, René, and Thimonier, Loÿs. "A Markovian concurrency measure." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 30.4 (1996): 295-304. <http://eudml.org/doc/92538>.

@article{Geniet1996,
author = {Geniet, Dominique, Schott, René, Thimonier, Loÿs},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Markov chains; concurrency measure},
language = {eng},
number = {4},
pages = {295-304},
publisher = {EDP-Sciences},
title = {A Markovian concurrency measure},
url = {http://eudml.org/doc/92538},
volume = {30},
year = {1996},
}

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
PB - EDP-Sciences
VL - 30
IS - 4
SP - 295
EP - 304
LA - eng
KW - Markov chains; concurrency measure
UR - http://eudml.org/doc/92538
ER -

References

top
  1. 1. A. ARNOLD, Finite transition System, Prentice Hall, 1994. Zbl0796.68141
  2. 2. A. ARNOLD and M. NIVAT, Comportements de processus L.I.T.P., Rapport No. 82-12, Univ. Paris, France. 
  3. 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. 4. J. M. AUTEBERT, Langages algébriques, Masson, 1987. MR888601
  5. 5. B. CHARRON-BOST, Mesures de la concurrence et du parallélisme des calculs répartis, Thèse, Univ. Paris-VII, France, 1989. 
  6. 6. S. EILENBERG, Automata, languages and machines, Academic Press, 1976. 
  7. 7. W. FELLER, An introduction to probability theory, Addison-Wesley, 1968. Zbl0155.23101
  8. 8. P. FLAJOLET, Analyse d'algorithmes de manipulation d'arbres et de fichiers, B.U.R.O. Cahiers, 34-35, 1981. 
  9. 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. Zbl0756.68023MR1033545
  10. 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. Zbl0602.68024MR894715
  11. 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. Zbl0757.68053MR1033547
  12. 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. 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. Zbl0746.68041MR1037073
  14. 14. C. PAIR, M. MOHR and R. SCHOTT, Construire les algorithmes, Dunod Informatique, 1988. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.