On the average parallelism in trace monoids

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2285, Issue , 2002, Pages 477-488

  Krob, Daniel ^a   Mairesse, Jean ^a   Michos, Ioannis ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937485356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_39     Document Type: Conference Paper

References (20)

1. J. Berstel and C. Reutenauer. Rational Series and their Languages. Springer Verlag, 1988.
2. V. Blondel, S. Gaubert, and J. Tsitsiklis. Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard. IEEE Trans. Autom. Control, 45(9):1762–1765, 2000.
3. M. Brilman. Evaluation de Performances d’une Classe de Systémes de Ressources Partagees. PhD thesis, Univ. Joseph Fourier - Grenoble I, 1996.
4. M. Brilman and J.M. Vincent. On the estimation of the throughput for a class of stochastic resources sharing systems. Mathematics of Operations Research, 23(2):305–321, 1998.
5. P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrange-ments. Number 85 in Lecture Notes in Mathematics. Springer Verlag, 1969.
6. C. Cérin and A. Petit. Speedup of recognizable trace languages. In Proc. MFCS 93, number 711 in Lect. Notes Comput. Sci., pages 332–341. Springer, 1993.
7. D. Cvetković, M. Doob, and H. Sachs. Spectra of Graphs. Theory and Application, volume 87 of Pure and Applied Mathematics. Academic Press, Paris, 1980.
8. V. Diekert and Y. Métivier. Partial commutation and traces. In Handbook of formal languages, volume 3, pages 457–533. Springer, 1997.
9. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapour, 1995.
10. S. Gaubert and J. Mairesse. Task resource models and (max,+) automata. In J. Gunawardena, editor, Idempotency, volume 11, pages 133–144. Cambridge University Press, 1998.
11. S. Gaubert and J. Mairesse. Performance evaluation of timed Petri nets using heaps of pieces. In P. Bucholz and M. Silva, editors, Petri Nets and Performance Models (PNPM’99), pages 158–169. IEEE Computer Society, 1999.
12. M. Goldwurm and M. Santini. Clique polynomials have a unique root of smallest modulus. Information Processing Letters, 75(3):127–132, 2000.
13. V. Hakim and J.-P. Nadal. Exact results for 2d directed animals on a strip of finite width. J. Phys. A: Math. Gen., 16:L213–L218, 1983.
14. A. Jean-Marie. Ers: A tool set for performance evaluation of discrete event systems. http://www-sop.inria.fr/mistral/soft/ers.html.
15. D. Krob, J. Mairesse, and I. Michos. On the average Cartier-Foata height of traces. In Proceedings of Comb’01: Combinatorics, Graph Theory and Applications, Electronic Notes in Discrete Mathematics, 2001.
16. N. Saheb. Concurrency measure in commutation monoids. Discrete Applied Mathematics, 24:223–236, 1989.
17. E. Seneta. Non-negative Matrices and Markov Chains. Springer series in statistics. Springer Verlag, Berlin, 1981.
18. R. Stanley. Enumerative Combinatorics, Volume I. Wadsworth & Brooks/Cole, Monterey, 1986.
19. G.X. Viennot. Heaps of pieces, I: Basic definitions and combinatorial lemmas. In Labelle and Leroux, editors, Combinatoire Enumerative, number 1234 in Lect. Notes in Math., pages 321–350. Springer, 1986.
20. H. Wilf. Generating functionology. Academic Press, 1990.