{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T11:16:56Z","timestamp":1782991016957,"version":"3.54.5"},"publisher-location":"Cham","reference-count":27,"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_19","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:24:01Z","timestamp":1776270241000},"page":"396-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6205-0682","authenticated-orcid":false,"given":"Mathieu","family":"Lehaut","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8214-204X","authenticated-orcid":false,"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8242-5357","authenticated-orcid":false,"given":"Nir","family":"Piterman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Bharat Adsul, Paul Gastin, Shantanu Kulkarni, and Pascal Weil. An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. In Pawel Sobocinski, Ugo\u00a0Dal Lago, and Javier Esparza, editors, Proceedings of the 39th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024, pages 2:1\u20132:13. ACM, 2024. https:\/\/doi.org\/10.1145\/3661814.3662110.","DOI":"10.1145\/3661814.3662110"},{"key":"19_CR2","unstructured":"S.\u00a0Akshay, Ionut Dinca, Blaise Genest, and Alin Stefanescu. Implementing realistic asynchronous automata. In FSTTCS\u201913, LIPIcs, pages 213\u2013224. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013."},{"key":"19_CR3","unstructured":"Raven Beutner, Bernd Finkbeiner, and Jesko Hecking-Harbusch. Translating asynchronous games for distributed synthesis. In International Conference on Concurrency Theory (CONCUR\u201919), volume 140 of LIPIcs, pages 26:1\u201326:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2019."},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Krishnendu Chatterjee, Thomas\u00a0A. Henzinger, and Nir Piterman. Generalized parity games. In Helmut Seidl, editor, Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings, volume 4423 of Lecture Notes in Computer Science, pages 153\u2013167. Springer, 2007. https:\/\/doi.org\/10.1007\/978-3-540-71389-0_12.","DOI":"10.1007\/978-3-540-71389-0_12"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Robert Cori, Yves M\u00e9tivier, and Wieslaw Zielonka. Asynchronous mappings and asynchronous cellular automata. Inf. Comput., 106(2):159\u2013202, 1993. URL: https:\/\/doi.org\/10.1006\/inco.1993.1052.","DOI":"10.1006\/inco.1993.1052"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Volker Diekert and Anca Muscholl. A note on M\u00e9tivier\u2019s construction of asynchronous automata for triangulated graphs. Fundam. Informaticae, 25(3):241\u2013246, 1996. https:\/\/doi.org\/10.3233\/FI-1996-253402.","DOI":"10.3233\/FI-1996-253402"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Volker Diekert and Grzegorz Rozenberg, editors. The Book of Traces. World Scientific, 1995. https:\/\/doi.org\/10.1142\/2563.","DOI":"10.1142\/2563"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Bernd Finkbeiner and Sven Schewe. Uniform distributed synthesis. In 20th Annual IEEE Symposium on Logic in Computer Science (LICS\u2019 05), pages 321\u2013330, 2005. https:\/\/doi.org\/10.1109\/LICS.2005.53.","DOI":"10.1109\/LICS.2005.53"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Paul Gastin, Nathalie Sznajder, and Marc Zeitoun. Distributed synthesis for well-connected architectures. Formal Methods Syst. Des., 34(3):215\u2013237, 2009. URL: https:\/\/doi.org\/10.1007\/s10703-008-0064-7, https:\/\/doi.org\/10.1007\/S10703-008-0064-7.","DOI":"10.1007\/S10703-008-0064-7"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"F\u01cenic\u01ce Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory, Series B, 16(1):47\u201356, 1974. URL: https:\/\/www.sciencedirect.com\/science\/article\/pii\/009589567490094X, https:\/\/doi.org\/10.1016\/0095-8956(74)90094-X.","DOI":"10.1016\/0095-8956(74)90094-X"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Blaise Genest, Hugo Gimbert, Anca Muscholl, and Igor Walukiewicz. Optimal Zielonka-type construction of deterministic asynchronous automata. In Automata, Languages and Programming, ICALP 2010, volume 6199 of Lecture Notes in Computer Science, pages 52\u201363. Springer, 2010. https:\/\/doi.org\/10.1007\/978-3-642-14162-1_5.","DOI":"10.1007\/978-3-642-14162-1_5"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Blaise Genest, Hugo Gimbert, Anca Muscholl, and Igor Walukiewicz. Asynchronous games over tree architectures. In Fedor\u00a0V. Fomin, Rusins Freivalds, Marta\u00a0Z. Kwiatkowska, and David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, volume 7966 of Lecture Notes in Computer Science, pages 275\u2013286. Springer, 2013. https:\/\/doi.org\/10.1007\/978-3-642-39212-2_26.","DOI":"10.1007\/978-3-642-39212-2_26"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Blaise Genest and Anca Muscholl. Constructing exponential-size deterministic Zielonka automata. In Automata, Languages and Programming, ICALP 2006, pages 565\u2013576. Springer, 2006.","DOI":"10.1007\/11787006_48"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Hugo Gimbert. Distributed asynchronous games with causal memory are undecidable. Logical Methods in Computer Science, Volume 18, Issue 3, 09 2022. https:\/\/doi.org\/10.46298\/lmcs-18(3:30)2022.","DOI":"10.46298\/lmcs-18(3:30)2022"},{"key":"19_CR15","unstructured":"Daniel Hausmann, Mathieu Lehaut, and Nir Piterman. Distribution of reconfiguration languages maintaining tree-like communication topology. In Automated Technology for Verification and Analysis - 22nd International Symposium, ATVA 2024, Kyoto, Japan, October 21-24, 2024, Proceedings, Lecture Notes in Computer Science. Springer, 2024."},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Siddharth Krishna and Anca Muscholl. A quadratic construction for Zielonka automata with acyclic communication structure. Theor. Comput. Sci., 503:109\u2013114, 2013. https:\/\/doi.org\/10.1016\/j.tcs.2013.07.015.","DOI":"10.1016\/j.tcs.2013.07.015"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Orna Kupferman and Moshe\u00a0Y. Vardi. Synthesizing distributed systems. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, LICS \u201901, page 389, USA, 2001. IEEE Computer Society.","DOI":"10.1109\/LICS.2001.932514"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Stephane Lafortune, Karen Rudie, and Stavros Tripakis. Thirty years of the Ramadge-Wonham theory of supervisory control: A retrospective and future perspectives [conference reports]. IEEE Control Systems Magazine, 38(4):111\u2013112, 2018. https:\/\/doi.org\/10.1109\/MCS.2018.2830083.","DOI":"10.1109\/MCS.2018.2830083"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Mathieu Lehaut, Anca Muscholl, and Nir Piterman. From trees to tree-like: Distribution and synthesis for asynchronous automata, 2026. URL: https:\/\/arxiv.org\/abs\/2601.14078, arXiv:2601.14078.","DOI":"10.1007\/978-3-032-22730-0_19"},{"key":"19_CR20","unstructured":"Christoph L\u00f6ding. Methods for the transformation of automata: Complexity and connection to second order logic. Master\u2019s thesis, Christian-Albrechts-University of Kiel, Kiel, Germany, 1999. Available at https:\/\/www.lics.rwth-aachen.de\/global\/show_document.asp?id=aaaaaaaaabcqdty."},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Antoni Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Report Series, (78), 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Madhavan Mukund and Milind\u00a0A. Sohoni. Keeping track of the latest gossip in a distributed system. Distributed Comput., 10(3):137\u2013148, 1997. https:\/\/doi.org\/10.1007\/S004460050031.","DOI":"10.1007\/S004460050031"},{"key":"19_CR23","unstructured":"Anca Muscholl and Igor Walukiewicz. Distributed synthesis for acyclic architectures. arXiv preprint arXiv:1402.3314, 2014. Conference version FST&TCS 2014."},{"key":"19_CR24","doi-asserted-by":"publisher","unstructured":"A.\u00a0Pnueli and R.\u00a0Rosner. Distributed reactive systems are hard to synthesize. In Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pages 746\u2013757 vol.2, 1990. https:\/\/doi.org\/10.1109\/FSCS.1990.89597.","DOI":"10.1109\/FSCS.1990.89597"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Peter Ramadge and Walter Wonham. Supervisory control of a class of discrete event systems. SIAM Journal on Control and Optimization, 25:206\u2013230, 01 1987. https:\/\/doi.org\/10.1137\/0325013.","DOI":"10.1137\/0325013"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Shmuel Safra. Exponential determinization for omega-automata with strong-fairness acceptance condition (extended abstract). In S.\u00a0Rao Kosaraju, Mike Fellows, Avi Wigderson, and John\u00a0A. Ellis, editors, Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, pages 275\u2013282. ACM, 1992. https:\/\/doi.org\/10.1145\/129712.129739.","DOI":"10.1145\/129712.129739"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Wieslaw Zielonka. Notes on finite asynchronous automata. RAIRO Theor. Informatics Appl., 21(2):99\u2013135, 1987. URL: https:\/\/doi.org\/10.1051\/ita\/1987210200991.","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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:47:13Z","timestamp":1782949633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22730-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227294","9783032227300"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22730-0_19","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"}}]}}