EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 30 / No 4 (1996) RAIRO-Theor. Inf. Appl., 30 4 (1996) 295-304 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 30, Number 4, 1996
Page(s) 295 - 304
DOI https://doi.org/10.1051/ita/1996300402951
Published online 01 February 2017
  1. 1. A. ARNOLD, Finite transition System, Prentice Hall, 1994. [Zbl: 0796.68141] [Google Scholar]
  2. 2. A. ARNOLD and M. NIVAT, Comportements de processus L.I.T.P., Rapport No. 82-12, Univ. Paris, France. [Google Scholar]
  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. [Google Scholar]
  4. 4. J. M. AUTEBERT, Langages algébriques, Masson, 1987. [MR: 888601] [Google Scholar]
  5. 5. B. CHARRON-BOST, Mesures de la concurrence et du parallélisme des calculs répartis, Thèse, Univ. Paris-VII, France, 1989. [Google Scholar]
  6. 6. S. EILENBERG, Automata, languages and machines, Academic Press, 1976. [Google Scholar]
  7. 7. W. FELLER, An introduction to probability theory, Addison-Wesley, 1968. [Zbl: 0155.23101] [Google Scholar]
  8. 8. P. FLAJOLET, Analyse d'algorithmes de manipulation d'arbres et de fichiers, B.U.R.O. Cahiers, 34-35, 1981. [EuDML: 272546] [Google Scholar]
  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. [MR: 1033545] [Zbl: 0756.68023] [Google Scholar]
  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. [EuDML: 92260] [MR: 894715] [Zbl: 0602.68024] [Google Scholar]
  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. [MR: 1033547] [Zbl: 0757.68053] [Google Scholar]
  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. [Google Scholar]
  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. [MR: 1037073] [Zbl: 0746.68041] [Google Scholar]
  14. 14. C. PAIR, M. MOHR and R. SCHOTT, Construire les algorithmes, Dunod Informatique, 1988. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.