{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:40:55Z","timestamp":1725543655792},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359074"},{"type":"electronic","value":"9783540359081"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11787006_48","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T19:23:09Z","timestamp":1151522589000},"page":"565-576","source":"Crossref","is-referenced-by-count":11,"title":["Constructing Exponential-Size Deterministic Zielonka Automata"],"prefix":"10.1007","author":[{"given":"Blaise","family":"Genest","sequence":"first","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11590156_27","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"M. Mukund","year":"2005","unstructured":"Mukund, M., Narayan Kumar, K., Adsul, B., Narayanan, V.: Causal Closure for MSC Languages. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 335\u2013347. Springer, Heidelberg (2005)"},{"key":"48_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11753728_8","volume-title":"Computer Science \u2013 Theory and Applications","author":"R. Morin","year":"2006","unstructured":"Morin, R., Baudru, N.: Unfolding Synthesis of Asynchronous Automata. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 46\u201357. Springer, Heidelberg (2006), Available at: http:\/\/www.cmi.univ-mrs.fr\/~morin\/papers\/CSR.pdf"},{"issue":"2","key":"48_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J.\u00a0of the ACM\u00a030(2), 323\u2013342 (1983)","journal-title":"J.\u00a0of the ACM"},{"issue":"2","key":"48_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. Inf.\u00a0and Comput.\u00a0106(2), 159\u2013202 (1993)","journal-title":"Inf.\u00a0and Comput."},{"volume-title":"The Book of Traces","year":"1995","key":"48_CR5","unstructured":"Diekert, V., Rozenberg, G., Muscholl, A. (eds.): The Book of Traces, vol.\u00a0Chapter 8. World Scientific, Singapore (1995)"},{"key":"48_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., Kuske, D., Muscholl, A.: A Kleene Theorem and Model Checking for a Class of Communicating Automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 30\u201348. Springer, Heidelberg (2004)"},{"issue":"1","key":"48_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., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. Inf.\u00a0and Comput.\u00a0202(1), 1\u201338 (2005)","journal-title":"Inf.\u00a0and Comput."},{"issue":"1","key":"48_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0890-5401(03)00123-8","volume":"187","author":"D. Kuske","year":"2003","unstructured":"Kuske, D.: Regular sets of infinite message sequence charts. Inf.\u00a0and Comput.\u00a0187(1), 80\u2013109 (2003)","journal-title":"Inf.\u00a0and Comput."},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ic.2003.09.005","volume":"189","author":"M. Lohrey","year":"2004","unstructured":"Lohrey, M., Muscholl, A.: Bounded MSC communication. Inf.\u00a0and Comput.\u00a0189, 135\u2013263 (2004)","journal-title":"Inf.\u00a0and Comput."},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"48_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-45294-X_22","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"B. Meenakshi","year":"2001","unstructured":"Meenakshi, B., Madhusudan, P.: Beyond Message Sequence Graphs. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 256\u2013267. Springer, Heidelberg (2001)"},{"key":"48_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-1-4757-6656-1_2","volume-title":"Synthesis and Control of Discrete Event Systems","author":"M. Mukund","year":"2002","unstructured":"Mukund, M.: From global specification to local implementations. In: Synthesis and Control of Discrete Event Systems, pp. 19\u201334. Kluwer, Dordrecht (2002)"},{"key":"48_CR13","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., Sohoni, M., Narayan Kumar, K.: Synthesizing Distributed Finite-State Systems from MSCs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 521\u2013535. Springer, Heidelberg (2000)"},{"issue":"3","key":"48_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s004460050031","volume":"10","author":"M. Mukund","year":"1997","unstructured":"Mukund, M., Sohoni, M.: Keeping Track of the Latest Gossip in a Distributed System. Distr.\u00a0Computing\u00a010(3), 137\u2013148 (1997)","journal-title":"Distr.\u00a0Computing"},{"key":"48_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":"J. Esparza","year":"2003","unstructured":"Esparza, J., Muscholl, A., \u015etef\u0103nescu, A.: Synthesis of Distributed Algorithms Using Asynchronous Automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 27\u201341. Springer, Heidelberg (2003)"},{"key":"48_CR16","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Note on finite asynchronous automata. R.A.I.R.O. - Informatique Th\u00e9orique et Applications\u00a021, 99\u2013135 (1987)","journal-title":"R.A.I.R.O. - Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11787006_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:20:19Z","timestamp":1619493619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11787006_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359074","9783540359081"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11787006_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}