{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:44:08Z","timestamp":1794339848046,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_8","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"46-57","source":"Crossref","is-referenced-by-count":6,"title":["Unfolding Synthesis of Asynchronous Automata"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Baudru","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00e9mi","family":"Morin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Baudru, N., Morin, R.: Safe Implementability of Regular Message Sequence Charts Specifications. In: Proc. of the ACIS 4th Int. Conf. SNDP, pp. 210\u2013217 (2003)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Baudru, N., Morin, R.: The Synthesis Problem of Netcharts (submitted, 2006)","DOI":"10.1007\/11767589_6"},{"key":"8_CR3","unstructured":"Bednarczyk, M.A.: Categories of Asynchronous Systems. PhD thesis in Computer Science, University of Sussex (1988)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1052","volume":"106","author":"R. Cori","year":"1993","unstructured":"Cori, R., M\u00e9tivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Inform. and Comput.\u00a0106, 159\u2013202 (1993)","journal-title":"Inform. and Comput."},{"key":"8_CR5","doi-asserted-by":"publisher","DOI":"10.1142\/2563","volume-title":"The Book of Traces","author":"V. Diekert","year":"1995","unstructured":"Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-30550-7_4","volume-title":"Developments in Language Theory","author":"B. Genest","year":"2004","unstructured":"Genest, B., Muscholl, A., Kuske, D.: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 30\u201348. Springer, Heidelberg (2004)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Genest, B., Muscholl, A.: Constructing Exponential-size Deterministic Zielonka Automata. Technical report, 12 pages (2006)","DOI":"10.1007\/11787006_48"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-58201-0_63","volume-title":"Automata, Languages, and Programming","author":"N. Klarlund","year":"1994","unstructured":"Klarlund, N., Mukund, M., Sohoni, M.: Determinizing Asynchronous Automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 130\u2013141. Springer, Heidelberg (1994)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-18088-5_18","volume-title":"Automata, Languages and Programming","author":"Y. M\u00e9tivier","year":"1987","unstructured":"M\u00e9tivier, Y.: An algorithm for computing asynchronous automata in the case of acyclic noncommutation graph. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 226\u2013236. Springer, Heidelberg (1987)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/11549345_59","volume-title":"Mathematical Foundations of Computer Science 2005","author":"R. Morin","year":"2005","unstructured":"Morin, R.: Concurrent Automata vs. Asynchronous Systems. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 686\u2013698. Springer, Heidelberg (2005)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-44618-4_37","volume-title":"CONCUR 2000 - Concurrency Theory","author":"M. Mukund","year":"2000","unstructured":"Mukund, M., Narayan Kumar, K., Sohoni, M.: Synthesizing distributed finite-state systems from MSCs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 521\u2013535. Springer, Heidelberg (2000)"},{"key":"8_CR12","unstructured":"Mukund, M., Sohoni, M.: Gossiping, Asynchronous Automata and Zielonka\u2019s Theorem. Report TCS-94-2, SPIC Science Foundation, Madras, India (1994)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-58201-0_64","volume-title":"Automata, Languages, and Programming","author":"A. Muscholl","year":"1994","unstructured":"Muscholl, A.: On the complementation of B\u00fcchi asynchronous cellular automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 142\u2013153. Springer, Heidelberg (1994)"},{"key":"8_CR14","first-page":"109","volume":"5","author":"G. Pighizzini","year":"1993","unstructured":"Pighizzini, G.: Synthesis of Nondeterministic Asynchronous Automata. Algebra. Logic and Applications\u00a05, 109\u2013126 (1993)","journal-title":"Algebra. Logic and Applications"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45187-7_2","volume-title":"CONCUR 2003 - Concurrency Theory","author":"A. \u015etef\u0103nescu","year":"2003","unstructured":"\u015etef\u0103nescu, A., Esparza, J., Muscholl, A.: Synthesis of distributed algorithms using asynchronous automata. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 27\u201341. Springer, Heidelberg (2003)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45711-9_14","volume-title":"Formal and Natural Computing","author":"P.S. Thiagarajan","year":"2002","unstructured":"Thiagarajan, P.S.: Regular Event Structures and Finite Petri Nets: A Conjecture. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 244\u2013256. Springer, Heidelberg (2002)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. In: RAIRO, Theoretical Informatics and Applications, Gauthiers-Villars, vol.\u00a021, pp. 99\u2013135 (1987)","DOI":"10.1051\/ita\/1987210200991"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:56Z","timestamp":1619492636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11753728_8","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}