{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:43:51Z","timestamp":1782953031825,"version":"3.54.5"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227294","type":"print"},{"value":"9783032227300","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22730-0_7","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:25:06Z","timestamp":1776270306000},"page":"133-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synthesising Asynchronous Automata from Fair Specifications"],"prefix":"10.1007","author":[{"given":"B\u00e9atrice","family":"B\u00e9rard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Monmege","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B","family":"Srivathsan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnab","family":"Sur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Adsul, B., Gastin, P., Kulkarni, S., Weil, P.: An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. In: LICS (2024). https:\/\/doi.org\/10.1145\/3661814.3662110","DOI":"10.1145\/3661814.3662110"},{"key":"7_CR2","unstructured":"Akshay, S., Dinca, I., Genest, B., Stefanescu, A.: Implementing realistic asynchronous automata. In: 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Lipics (2013)"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Alur, R., Henzinger, T.A.: Finitary fairness. ACM Trans. Program. Lang. Syst. 20(6), 1171\u20131194 (Nov 1998). https:\/\/doi.org\/10.1145\/295656.295659, https:\/\/doi.org\/10.1145\/295656.295659","DOI":"10.1145\/295656.295659"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Baudru, N.: Compositional synthesis of asynchronous automata. Theoretical Computer Science 412 (2011)","DOI":"10.1016\/j.tcs.2011.03.030"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Baudru, N., Morin, R.: Unfolding synthesis of asynchronous automata. In: Computer Science\u2013Theory and Applications: First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12. 2006. Proceedings 1. pp. 46\u201357. Springer (2006)","DOI":"10.1007\/11753728_8"},{"key":"7_CR6","unstructured":"B\u00e9rard, B., Monmege, B., Srivathsan, B., Sur, A.: Synthesising asynchronous automata from fair specifications (2025), https:\/\/arxiv.org\/abs\/2504.14623"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cartier, P., Foata, D.: Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. Springer (1969)","DOI":"10.1007\/BFb0079468"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Cori, R., M\u00e9tivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation 106, 159\u2013202 (1993)","DOI":"10.1006\/inco.1993.1052"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Diekert, V., Muscholl, A.: Trace theory. In: Padua, D.A. (ed.) Encyclopedia of Parallel Computing, pp. 2071\u20132079. Springer (2011). https:\/\/doi.org\/10.1007\/978-0-387-09766-4_491","DOI":"10.1007\/978-0-387-09766-4_491"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1, 115\u2013138 (1971)","DOI":"10.1007\/BF00289519"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Optimal Zielonka-type construction of deterministic asynchronous automata. In: ICALP (2010)","DOI":"10.1007\/978-3-642-14162-1_5"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Genest, B., Muscholl, A.: Constructing exponential-size deterministic Zielonka automata. In: ICALP\u201906. LNCS, vol.\u00a04052. Springer (2006)","DOI":"10.1007\/11787006_48"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Hausmann, D., Lehaut, M., Piterman, N.: Distribution of reconfiguration languages maintaining tree-like communication topology. In: ATVA (2024)","DOI":"10.1007\/978-3-031-78709-6_8"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Krishna, S., Muscholl, A.: A quadratic construction for Zielonka automata with acyclic communication structure. Theoretical Computer Science 503 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.07.015","DOI":"10.1016\/j.tcs.2013.07.015"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Thiagarajan, P.S., Yang, S.: The MSO theory of connectedly communicating processes. In: FSTTCS\u201905. LNCS, vol.\u00a03821. Springer (2005)","DOI":"10.1007\/11590156_16"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Monmege, B., B\u00e9rard, B., Sur, A., Srivathsan, B., Mohandi, A.: Faast: Fair asynchronous automata synthesis tool (Jan 2026). https:\/\/doi.org\/10.5281\/zenodo.18165965","DOI":"10.5281\/zenodo.18165965"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Mukund, M.: Automata on distributed alphabets. In: Modern Applications of Automata Theory, IISc Research Monographs Series, vol.\u00a02, pp. 257\u2013288. World Scientific (2012)","DOI":"10.1142\/9789814271059_0009"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Mukund, M., Sohoni\u00a0Milind, A.: Keeping track of the latest gossip in a distributed system. Distributed Computing 10(3), 137\u2013148 (1997)","DOI":"10.1007\/s004460050031"},{"key":"7_CR19","unstructured":"Pighizzini, G.: Synthesis of nondeterministic asynchronous automata. In: Semantics of programming languages and model theory. vol.\u00a05, pp. 109\u2013126. Gordon & Breach New York (1993)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Stefanescu, A., Esparza, J., Muscholl, A.: Synthesis of distributed algorithms using asynchronous automata. In: CONCUR (2003)","DOI":"10.1007\/978-3-540-45187-7_2"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. Theoretical Informatics and Applications 21(2), 99\u2013135 (1987), http:\/\/www.numdam.org\/item?id=ITA_1987__21_2_99_0","DOI":"10.1051\/ita\/1987210200991"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22730-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:46:59Z","timestamp":1782949619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22730-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227294","9783032227300"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22730-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"15 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2026\/conferences\/fossacs\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}