{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:19:10Z","timestamp":1725815950142},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_21","type":"book-chapter","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T20:23:50Z","timestamp":1422390230000},"page":"217-228","source":"Crossref","is-referenced-by-count":0,"title":["Associativity for Binary Parallel Processes: A Quantitative Study"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bodini","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Genitrini","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Peschanski","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Rolin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00453-011-9557-7","volume":"63","author":"F. Bassino","year":"2012","unstructured":"Bassino, F., David, J., Nicaud, C.: Average case analysis of Moore\u2019s state minimization algorithm. Algorithmica\u00a063(1-2), 509\u2013531 (2012)","journal-title":"Algorithmica"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-55251-0_2","volume-title":"CAAP \u201992","author":"F. Bergeron","year":"1992","unstructured":"Bergeron, F., Flajolet, P., Salvy, B.: Varieties of increasing trees. In: Raoult, J.-C. (ed.) CAAP 1992. LNCS, vol.\u00a0581, pp. 24\u201348. Springer, Heidelberg (1992)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bodini, O., Genitrini, A., Peschanski, F.: Enumeration and random generation of concurrent computations. In: DMTCS AofA 2012 Proceedings, pp. 83\u201396 (2012)","DOI":"10.46298\/dmtcs.2986"},{"key":"21_CR4","unstructured":"Bodini, O., Genitrini, A., Peschanski, F.: The Combinatorics of Non-determinism. In: proc. FSTTCS 2013. LIPIcs, vol.\u00a024, pp. 425\u2013436 (2013)"},{"key":"21_CR5","unstructured":"Bodini, O., Genitrini, A., Peschanski, F.: Enumeration and random generation of concurrent computations. arXiv\/1407.1873 (page under submission, 2014)"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst.\u00a08(2), 244\u2013263 (1986)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02124750","volume":"5","author":"R.M. Corless","year":"1996","unstructured":"Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the Lambert W Function. Advances in Computational Mathematics\u00a05, 329\u2013359 (1996)","journal-title":"Advances in Computational Mathematics"},{"key":"21_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-211-75357-6","volume-title":"Random trees","author":"M. Drmota","year":"2009","unstructured":"Drmota, M.: Random trees. Springer, Vienna (2009)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s00026-011-0115-4","volume":"15","author":"G. Duchamp","year":"2011","unstructured":"Duchamp, G., Hivert, F., Novelli, J.-C., Thibon, J.-Y.: Noncommutative Symmetric Functions VII: Free Quasi-Symmetric Functions Revisited. Ann. Comb.\u00a015, 655\u2013673 (2011)","journal-title":"Ann. Comb."},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","volume":"39","author":"P. Flajolet","year":"1992","unstructured":"Flajolet, P., Gardy, D., Thimonier, L.: Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. D. A. Math.\u00a039(3), 207\u2013229 (1992)","journal-title":"D. A. Math."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P., Odlyzko, A.M.: Singularity analysis of generating functions. In SIAM J. Discrete Math.\u00a03, 216\u2013240 (1990)","journal-title":"In SIAM J. Discrete Math."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge UP. (2009)","DOI":"10.1017\/CBO9780511801655"},{"issue":"1","key":"21_CR13","first-page":"1","volume":"11","author":"S. Gerhold","year":"2004","unstructured":"Gerhold, S.: On Some Non-Holonomic Sequences. Elec. J. Comb.\u00a011(1), 1\u20138 (2004)","journal-title":"Elec. J. Comb."},{"key":"21_CR14","unstructured":"Knuth, D.E.: The art of computer programming, 2nd edn. sorting and searching, vol.\u00a03. Addison Wesley Longman Publishing Co., Inc. (1998)"},{"issue":"1-3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0012-365X(03)00233-4","volume":"273","author":"D. Krob","year":"2003","unstructured":"Krob, D., Mairesse, J., Michos, I.: Computing the average parallelism in trace monoids. Discrete Mathematics\u00a0273(1-3), 131\u2013162 (2003)","journal-title":"Discrete Mathematics"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer (1980)","DOI":"10.1007\/3-540-10235-3"},{"key":"21_CR17","unstructured":"Mishna, M., Zabrocki, M.: Analytic aspects of the shuffle product. CoRR (2008)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Wilf, H.S., Nijenhuis, A.: Combinatorial algorithms: An update (1989)","DOI":"10.1137\/1.9781611970166"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:28:14Z","timestamp":1651073294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}