{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:11:12Z","timestamp":1748405472679,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031896095","type":"print"},{"value":"9783031896101","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-89610-1_5","type":"book-chapter","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:41:51Z","timestamp":1748335311000},"page":"69-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Asynchronous Transition System Games for\u00a0Two Processes and\u00a0Their Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0292-6670","authenticated-orcid":false,"given":"Bharat","family":"Adsul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1531-6780","authenticated-orcid":false,"given":"Nehul","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,26]]},"reference":[{"key":"5_CR1","unstructured":"Beutner, R., Finkbeiner, B., Hecking-Harbusch, J.: Translating asynchronous games for distributed synthesis. In: 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0140, pp. 26:1\u201326:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2019)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific (1995)","DOI":"10.1142\/9789814261456"},{"key":"5_CR3","unstructured":"Fijalkow, N., et al.: Games on Graphs (2023)"},{"key":"5_CR4","unstructured":"Fijalkow, N., Horn, F.: The surprizing complexity of generalized reachability games (2012). https:\/\/arxiv.org\/abs\/1010.2420"},{"key":"5_CR5","unstructured":"Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.R.: Global winning conditions in synthesis of distributed systems with causal memory. In: 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0216, pp. 20:1\u201320:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022)"},{"key":"5_CR6","unstructured":"Finkbeiner, B., G\u00f6lz, P.: Synthesis in distributed environments. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a093, pp. 28:1\u201328:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2018)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Olderog, E.R.: Petri games: synthesis of distributed systems with causal memory. Inf. Comput. 253, 181\u2013203 (2017), gandALF 2014","DOI":"10.1016\/j.ic.2016.07.006"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Gastin, P., Lerman, B., Zeitoun, M.: Distributed games with causal memory are decidable for series-parallel systems. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 275\u2013286. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30538-5_23","DOI":"10.1007\/978-3-540-30538-5_23"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Asynchronous games over tree architectures. In: Automata. Languages, and Programming, pp. 275\u2013286. Springer, Berlin, Heidelberg (2013)","DOI":"10.1007\/978-3-642-39212-2_26"},{"key":"5_CR10","unstructured":"Gimbert, H.: On the control of asynchronous automata. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a093, pp. 30:1\u201330:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2018)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gimbert, H.: Distributed asynchronous games with causal memory are undecidable. Log. Methods Comput. Sci. 18(3) (2022)","DOI":"10.46298\/lmcs-18(3:30)2022"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata logics, and infinite games: a guide to current research. Springer-Verlag, Berlin, Heidelberg (2002)","DOI":"10.1007\/3-540-36387-4"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Madhusudan, P., Thiagarajan, P.S., Yang, S.: The MSO theory of connectedly communicating processes. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 201\u2013212. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11590156_16","DOI":"10.1007\/11590156_16"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1142\/9789814271059_0009","volume":"2","author":"M Mukund","year":"2012","unstructured":"Mukund, M.: Automata on distributed alphabets. Modern Appl. Automata Theor. 2, 257\u2013288 (2012)","journal-title":"Modern Appl. Automata Theor."},{"key":"5_CR15","unstructured":"Muscholl, A., Walukiewicz, I.: Distributed synthesis for acyclic architectures. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), vol. 29, pp. 639\u2013651. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2014)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Pneuli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, vol. 2, pp. 746\u2013757 (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"5_CR17","unstructured":"Thomas, W.: Solution of church\u2019s problem: a tutorial. New Perspectives on Games and Interaction 4 (01 2008)"},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. RAIRO-Theor. Inf. Appl. 21(2), 99\u2013135 (1987)","journal-title":"RAIRO-Theor. Inf. Appl."}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-89610-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T09:06:19Z","timestamp":1748336779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-89610-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031896095","9783031896101"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-89610-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"26 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indian Conference on Logic and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icla2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logicindia.org\/icla\/icla2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}