{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T20:59:25Z","timestamp":1772571565405,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3552,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0012-365x(03)00233-4","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T14:49:36Z","timestamp":1063378176000},"page":"131-162","source":"Crossref","is-referenced-by-count":20,"title":["Computing the average parallelism in trace monoids"],"prefix":"10.1016","volume":"273","author":[{"given":"Daniel","family":"Krob","sequence":"first","affiliation":[]},{"given":"Jean","family":"Mairesse","sequence":"additional","affiliation":[]},{"given":"Ioannis","family":"Michos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00233-4_BIB1","series-title":"Rational Series and their Languages","author":"Berstel","year":"1988"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB2","unstructured":"A. Bertoni, M. Goldwurm, B. Palano, A fast parallel algorithm for the speed-up problem of traces, in: Proceedings of the workshop on Trace Theory and Code Parallelization, Vol. 263-00 in Rapporto Interno, Univ. degli Studi di Milano, 2000, pp. 29\u201336."},{"issue":"9","key":"10.1016\/S0012-365X(03)00233-4_BIB3","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1109\/9.880644","article-title":"Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard","volume":"45","author":"Blondel","year":"2000","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB4","article-title":"Markov chains: Gibbs fields, Monte Carlo simulation, and queues","volume":"Vol. 31","author":"Br\u00e9maud","year":"1999"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB5","unstructured":"M. Brilman, Evaluation de Performances d'une Classe de Syst\u00e8mes de Ressources Partag\u00e9es, Ph.D. Thesis, Univ. Joseph Fourier, Grenoble I, 1996."},{"issue":"2","key":"10.1016\/S0012-365X(03)00233-4_BIB6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1287\/moor.23.2.305","article-title":"On the estimation of the throughput for a class of stochastic resources sharing systems","volume":"23","author":"Brilman","year":"1998","journal-title":"Math. Oper. Res."},{"issue":"5","key":"10.1016\/S0012-365X(03)00233-4_BIB7","first-page":"201","article-title":"The generating function for max(n1,\u2026,nk)","volume":"21","author":"Carlitz","year":"1962","journal-title":"Portugal. Math."},{"key":"10.1016\/S0012-365X(03)00233-4_BIB8","series-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements","volume":"Vol. 85","author":"Cartier","year":"1969"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB9","doi-asserted-by":"crossref","unstructured":"C. C\u00e9rin, A. Petit, Speedup of recognizable trace languages, in: Proceedings of the MFCS 93, Lecture Notes in Computer Science, Vol. 711, Springer, Berlin, 1993, pp. 332\u2013341.","DOI":"10.1007\/3-540-57182-5_25"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB10","article-title":"Spectra of Graphs. Theory and Application","volume":"Vol. 87","author":"Cvetkovi\u0107","year":"1980"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB11","doi-asserted-by":"crossref","unstructured":"V. Diekert, Y. M\u00e9tivier, Partial commutation and traces, in: Handbook of Formal Languages, Vol. 3, Springer, Berlin, 1997, pp. 457\u2013533.","DOI":"10.1007\/978-3-642-59126-6_8"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB12","doi-asserted-by":"crossref","unstructured":"V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, 1995.","DOI":"10.1142\/9789814261456"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB13","unstructured":"P. Flajolet, R. Sedgewick, The average case analysis of algorithms: complex asymptotics and generating functions, Reseach Report RR-2026, INRIA, Rocquencourt, France, 1993."},{"key":"10.1016\/S0012-365X(03)00233-4_BIB14","doi-asserted-by":"crossref","unstructured":"S. Gaubert, J. Mairesse, Task resource models and (max,+) automata, in: J. Gunawardena (Eds.), Idempotency, Vol. 11, Cambridge University Press, Cambridge, 1998, pp. 133\u2013144.","DOI":"10.1017\/CBO9780511662508.009"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB15","series-title":"Petri Nets and Performance Models (PNPM\u201999)","first-page":"158","article-title":"Performance evaluation of timed Petri nets using heaps of pieces","author":"Gaubert","year":"1999"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/jgt.3190050310","article-title":"Matchings and walks in graphs","volume":"5","author":"Godsil","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB17","series-title":"Algebraic Combinatorics","author":"Godsil","year":"1993"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/jgt.3190050203","article-title":"On the theory of the matching polynomial","volume":"5","author":"Godsil","year":"1981","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/S0012-365X(03)00233-4_BIB19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0020-0190(00)00086-7","article-title":"Clique polynomials have a unique root of smallest modulus","volume":"75","author":"Goldwurm","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(03)00233-4_BIB20","series-title":"Concrete Mathematics: a Foundation for Computer Science","author":"Graham","year":"1994"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB21","doi-asserted-by":"crossref","first-page":"L213","DOI":"10.1088\/0305-4470\/16\/7\/003","article-title":"Exact results for 2d directed animals on a strip of finite width","volume":"16","author":"Hakim","year":"1983","journal-title":"J. Phys. A: Math. Gen."},{"key":"10.1016\/S0012-365X(03)00233-4_BIB22","unstructured":"A. Jean-Marie, ERS: a tool set for performance evaluation of discrete event systems. http:\/\/www-sop.inria.fr\/mistral\/soft\/ers.html."},{"key":"10.1016\/S0012-365X(03)00233-4_BIB23","unstructured":"A. Jean-Marie, personal communication, September 2001."},{"key":"10.1016\/S0012-365X(03)00233-4_BIB24","series-title":"Proceedings of STACS\u201902, Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45841-7_39","article-title":"On the average parallelism in trace monoids","author":"Krob","year":"2002"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB25","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1051\/jphys:0198200430110156100","article-title":"Directed lattice animals in 2 dimensions","volume":"43","author":"Nadal","year":"1982","journal-title":"J. Phys."},{"key":"10.1016\/S0012-365X(03)00233-4_BIB26","series-title":"Markov Chains","author":"Revuz","year":"1975"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB27","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(92)90287-K","article-title":"Concurrency measure in commutation monoids","volume":"24","author":"Saheb","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00233-4_BIB28","doi-asserted-by":"crossref","unstructured":"N. Saheb, A. Zemmari, Methods for computing the concurrency degree of commutation monoids, in: Proceedings FPSAC\u201900, Moscow, Russia, Springer, Berlin, 2000, pp. 731\u2013742.","DOI":"10.1007\/978-3-662-04166-6_72"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB29","doi-asserted-by":"crossref","unstructured":"E. Seneta, Non-negative Matrices and Markov Chains, Springer Series in Statistics, Springer, Berlin, 1981.","DOI":"10.1007\/0-387-32792-4"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB30","doi-asserted-by":"crossref","unstructured":"R. Stanley, Enumerative Combinatorics, Vol. I, Wadsworth & Brooks\/Cole, Monterey, 1986.","DOI":"10.1007\/978-1-4615-9763-6_1"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB31","series-title":"The Theory of Functions","author":"Titchmarsh","year":"1975"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB32","doi-asserted-by":"crossref","unstructured":"G.X. Viennot, Heaps of pieces, I: Basic definitions and combinatorial lemmas, in: Labelle, Leroux (Eds.), Combinatoire \u00c9num\u00e9rative, Lecture Notes in Mathematics, Vol. 1234, Springer, Berlin, 1986, pp. 321\u2013350.","DOI":"10.1007\/BFb0072524"},{"key":"10.1016\/S0012-365X(03)00233-4_BIB33","series-title":"Generatingfunctionology","author":"Wilf","year":"1990"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002334?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002334?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T13:21:24Z","timestamp":1551014484000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0012365X03002334"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00233-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}