{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:23:05Z","timestamp":1776316985572,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141614","type":"print"},{"value":"9783642141621","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_5","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:21Z","timestamp":1278321981000},"page":"52-63","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata"],"prefix":"10.1007","author":[{"given":"Blaise","family":"Genest","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Gimbert","sequence":"additional","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-04081-8_9","volume-title":"CONCUR 2009 - Concurrency Theory","author":"N. Baudru","year":"2009","unstructured":"Baudru, N.: Distributed Asynchronous Automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009 - Concurrency Theory. LNCS, vol.\u00a05710, pp. 115\u2013130. Springer, Heidelberg (2009)"},{"key":"5_CR2","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. Information and Computation\u00a0106, 159\u2013202 (1993)","journal-title":"Information and Computation"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Diekert, V., Muscholl, A.: Construction of asynchronous automata. In: Diekert, Rozenberg (eds.) [4], pp. 249\u2013267","DOI":"10.1142\/9789814261456_0008"},{"key":"5_CR4","volume-title":"The Book of Traces","year":"1995","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"issue":"6","key":"5_CR5","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1016\/j.ic.2006.01.005","volume":"204","author":"B. Genest","year":"2006","unstructured":"Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput.\u00a0204(6), 920\u2013956 (2006)","journal-title":"Inf. Comput."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/11787006_48","volume-title":"Automata, Languages and Programming","author":"B. Genest","year":"2006","unstructured":"Genest, B., Muscholl, A.: Constructing Exponential-Size Deterministic Zielonka Automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 565\u2013576. Springer, Heidelberg (2006)"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.08.004","volume":"202","author":"J.G. Henriksen","year":"2005","unstructured":"Henriksen, J.G., Mukund, M., Kumar, K.N., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. Inf. Comput.\u00a0202(1), 1\u201338 (2005)","journal-title":"Inf. Comput."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"5_CR9","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent Program Schemes and their Interpretations. DAIMI Rep. PB\u00a078, Aarhus University, Aarhus (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 non-commutation graph. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 226\u2013236. Springer, Heidelberg (1987)"},{"key":"5_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., Kumar, K.N., 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":"5_CR12","unstructured":"Mukund, M., Sohoni, M.: Gossiping, Asynchronous Automata and Zielonka\u2019s Theorem. Report TCS-94-2, School of Mathematics, SPIC Science Foundation, Madras, India (1994)"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s004460050031","volume":"10","author":"M. Mukund","year":"1997","unstructured":"Mukund, M., Sohoni, M.A.: Keeping Track of the Latest Gossip in a Distributed System. Distributed Computing\u00a010(3), 137\u2013148 (1997)","journal-title":"Distributed Computing"},{"key":"5_CR14","unstructured":"Stefanescu, A.: Automatic synthesis of distributed transition systems. PhD thesis, Universit\u00e4t Stuttgart (2006)"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. RAIRO\u2013Theoretical Informatics and Applications\u00a021, 99\u2013135 (1987)","journal-title":"RAIRO\u2013Theoretical Informatics and Applications"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-51237-3_22","volume-title":"Logic at Botik 1989","author":"W. Zielonka","year":"1989","unstructured":"Zielonka, W.: Safe executions of recognizable trace languages by asynchronous automata. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol.\u00a0363, pp. 278\u2013289. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:38:11Z","timestamp":1558294691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}