{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T10:14:39Z","timestamp":1744280079222,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031177149"},{"type":"electronic","value":"9783031177156"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17715-6_12","type":"book-chapter","created":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T09:02:27Z","timestamp":1664701347000},"page":"170-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Combinatorial Study of\u00a0Async\/Await Processes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1825-0097","authenticated-orcid":false,"given":"Matthieu","family":"Dien","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5480-0236","authenticated-orcid":false,"given":"Antoine","family":"Genitrini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4206-3283","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Peschanski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,3]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-48057-1_5","volume-title":"Mathematical Foundations of Computer Science 2015","author":"S Abbes","year":"2015","unstructured":"Abbes, S., Mairesse, J.: Uniform generation in trace monoids. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 63\u201375. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_5"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-79987-8_9","volume-title":"Combinatorial Algorithms","author":"A Bychkov","year":"2021","unstructured":"Bychkov, A., Pogudin, G.: Optimal monomial quadratization for ODE systems. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 122\u2013136. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_9"},{"key":"12_CR3","unstructured":"Basset, N., Mairesse, J., Soria, M.: Uniform sampling for networks of automata. In: Meyer, R., Nestmann, U. (eds.) CONCUR 2017, Berlin, Germany, 5\u20138 September 2017, LIPIcs, vol. 85, pp. 36:1\u201336:16 (2017)"},{"issue":"3","key":"12_CR4","first-page":"1","volume":"22","author":"O Bodini","year":"2021","unstructured":"Bodini, O., Dien, M., Genitrini, A., Peschanski, F.: Quantitative and algorithmic aspects of barrier synchronization in concurrency. Discret. Math. Theor. Comput. Sci. 22(3), 1\u201336 (2021)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bousquet-M\u00e9lou, M., Claesson, A., Dukes, M., Kitaev, S.: (2+2)-free posets, ascent sequences and pattern avoiding permutations. J. Comb. Theory, Ser. A 117(7), 884\u2013909 (2010)","DOI":"10.1016\/j.jcta.2009.12.007"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions is $$\\sharp $$p-complete. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 175\u2013181. Association for Computing Machinery, New York (1991)","DOI":"10.1145\/103418.103441"},{"issue":"4","key":"12_CR7","first-page":"4","volume":"27","author":"S Dittmer","year":"2020","unstructured":"Dittmer, S., Pak, I.: Counting linear extensions of restricted posets. Electron. J. Comb. 27(4), 4\u201348 (2020)","journal-title":"Electron. J. Comb."},{"key":"12_CR8","unstructured":"ECMA international: ECMAScript Language Specification, 9th edn. (2018)"},{"key":"12_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77426-6","volume-title":"Unfoldings","author":"J Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings. Springer, Heidleberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77426-6"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0012-365X(83)90072-9","volume":"47","author":"PC Fishburn","year":"1983","unstructured":"Fishburn, P.C.: Interval lengths for interval orders: a minimization problem. Disc. Math. 47, 63\u201382 (1983)","journal-title":"Disc. Math."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(85)90042-1","volume":"55","author":"PC Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval graphs and interval orders. Disc. Math. 55(2), 135\u2013149 (1985)","journal-title":"Disc. Math."},{"key":"12_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.disc.2006.01.003","volume":"306","author":"M Huber","year":"2006","unstructured":"Huber, M.: Fast perfect sampling from linear extensions. Disc. Math. 306(4), 420\u2013428 (2006)","journal-title":"Disc. Math."},{"key":"12_CR14","unstructured":"Kangas, K., Hankala, T., Niinim\u00e4ki, T.M., Koivisto, M.: Counting linear extensions of sparse posets. In: IJCAI 2016. IJCAI\/AAAI Press (2016)"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s11083-011-9213-5","volume":"29","author":"SM Khamis","year":"2012","unstructured":"Khamis, S.M.: Exact counting of unlabeled rigid interval posets regarding or disregarding height. Order 29(3), 443\u2013461 (2012)","journal-title":"Order"},{"key":"12_CR16","unstructured":"M\u00f6rhing, R.H.: Algorithms and order (edited by ivan rival), chap. Computationally tractable classes of ordered sets, p. 127. Kluwer Academic Publishers (1987)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-19811-3_10","volume-title":"Fundamental Approaches to Software Engineering","author":"J Oudinet","year":"2011","unstructured":"Oudinet, J., Denise, A., Gaudel, M.-C., Lassaigne, R., Peyronnet, S.: Uniform Monte-Carlo model checking. In: Giannakopoulou, D., Orejas, F. (eds.) FASE 2011. LNCS, vol. 6603, pp. 127\u2013140. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19811-3_10"},{"key":"12_CR18","unstructured":"Prasad, K., Patil, A., Miller, H.: Programming Models for Distributed Computing, chap. Futures and Promises (2017)"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/S0097539791202647","volume":"23","author":"G Pruesse","year":"1994","unstructured":"Pruesse, G., Ruskey, F.: Generating linear extensions fast. SIAM J. Comput. 23(2), 373\u2013386 (1994)","journal-title":"SIAM J. Comput."},{"key":"12_CR20","unstructured":"Selivanov, Y.: PEP 492 - Coroutines with async and await syntax. Python Org. (2015)"},{"issue":"01","key":"12_CR21","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1142\/S0218216598000073","volume":"07","author":"A Stoimenow","year":"1998","unstructured":"Stoimenow, A.: Enumeration of chord diagrams and an upper bound for vassiliev invariants. J. Knot Theory Ramifications 07(01), 93\u2013114 (1998)","journal-title":"J. Knot Theory Ramifications"},{"issue":"8","key":"12_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17715-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T23:04:12Z","timestamp":1664751852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17715-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031177149","9783031177156"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17715-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/viam.science.tsu.ge\/clas2022\/ictac\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}