{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:13:29Z","timestamp":1742912009818,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156427"},{"type":"electronic","value":"9783642156434"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","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-15643-4_3","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T13:39:39Z","timestamp":1284989979000},"page":"18-21","source":"Crossref","is-referenced-by-count":0,"title":["Synthesis: Words and Traces"],"prefix":"10.1007","author":[{"given":"Igor","family":"Walukiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Texts in Logic and Games","first-page":"29","volume-title":"Logic and Automata","author":"A. Arnold","year":"2007","unstructured":"Arnold, A., Walukiewicz, I.: Nondeterministic controllers of nondeterministic processes. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata. Texts in Logic and Games, vol.\u00a02, pp. 29\u201352. Amsterdam University Press, Amsterdam (2007)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J., Landweber, L.: Solving sequential conditions by finite state strategies. Trans. Amer. Math. Soc.\u00a0138, 367\u2013378 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"3_CR3","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second-order arithmetic. In: Proc. 1960 Int. Congr. for Logic, Methodology and Philosophy of Science, pp. 1\u201311 (1962)"},{"key":"3_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4070-7","volume-title":"Introduction to Discrete Event Systems","author":"C.G. Cassandras","year":"1999","unstructured":"Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-95891-8_16","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"T. Chatain","year":"2009","unstructured":"Chatain, T., Gastin, P., Sznajder, N.: Natural specifications yield decidability for distributed synthesis of asynchronous systems. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 141\u2013152. Springer, Heidelberg (2009)"},{"key":"3_CR6","first-page":"3","volume-title":"Summaries of the Summer Institute of Symbolic Logic","author":"A. Church","year":"1957","unstructured":"Church, A.: Applications of recursive arithmetic to the problem of cricuit synthesis. In: Summaries of the Summer Institute of Symbolic Logic, vol.\u00a0I, pp. 3\u201350. Cornell Univ., Ithaca (1957)"},{"volume-title":"The Book of Traces","year":"1995","key":"3_CR7","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30538-5_23","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"P. Gastin","year":"2004","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.\u00a03328, pp. 275\u2013286. Springer, Heidelberg (2004)"},{"key":"3_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2217-1","volume-title":"Modeling and control of logical discrete event systems","author":"R. Kumar","year":"1995","unstructured":"Kumar, R., Garg, V.K.: Modeling and control of logical discrete event systems. Kluwer Academic Pub., Dordrecht (1995)"},{"key":"3_CR10","unstructured":"Kupferman, O., Vardi, M.: Synthesizing distributed systems. In: Proc. 16th IEEE Symp. on Logic in Computer Science (2001)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-48224-5_33","volume-title":"Automata, Languages and Programming","author":"P. Madhusudan","year":"2001","unstructured":"Madhusudan, P., Thiagarajan, P.: Distributed control and synthesis for local specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 396\u2013407. Springer, Heidelberg (2001)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-45694-5_11","volume-title":"CONCUR 2002 - Concurrency Theory","author":"P. Madhusudan","year":"2002","unstructured":"Madhusudan, P., Thiagarajan, P.: A decidable class of asynchronous distributed controllers. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 145\u2013160. Springer, Heidelberg (2002)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11590156_16","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"P. Madhusudan","year":"2005","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.\u00a03821, pp. 201\u2013212. Springer, Heidelberg (2005)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-24597-1_29","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"S. Mohalik","year":"2003","unstructured":"Mohalik, S., Walukiewicz, I.: Distributed games. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 338\u2013351. Springer, Heidelberg (2003)"},{"key":"3_CR15","unstructured":"Muscholl, A., Walukiewicz, I., Zeitoun, M.: A look at the control of asynchronous automata. In: Perspectives in Concurrency Theory \u2013 Festschrift for P.S. Thiagarajan, pp. 356\u2013371. Universities Press (2008)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/S0898-1221(00)00333-3","volume":"41","author":"G. Peterson","year":"2001","unstructured":"Peterson, G., Reif, J., Azhar, S.: Lower bounds for multiplayer noncooperative games of incomplete information. Comput. Math. Appl.\u00a041, 957\u2013992 (2001)","journal-title":"Comput. Math. Appl."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Peterson, G.L., Reif, J.H.: Multi-person alternation. In: Proc. IEEE FOCS, pp. 348\u2013363 (1979)","DOI":"10.1109\/SFCS.1979.25"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: 31th IEEE Symposium Foundations of Computer Science (FOCS 1990), pp. 746\u2013757 (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"3_CR19","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the AMS\u00a0141, 1\u201323 (1969)","journal-title":"Transactions of the AMS"},{"key":"3_CR20","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/013","volume-title":"Automata on Infinite Objects and Church\u2019s Problem","author":"M.O. Rabin","year":"1972","unstructured":"Rabin, M.O.: Automata on Infinite Objects and Church\u2019s Problem. American Mathematical Society, Providence (1972)"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"P.J.G. Ramadge","year":"1989","unstructured":"Ramadge, P.J.G., Wonham, W.M.: The control of discrete event systems. Proceedings of the IEEE\u00a077(2), 81\u201398 (1989)","journal-title":"Proceedings of the IEEE"},{"key":"3_CR22","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\u2013Theoretical Informatics and Applications\u00a021, 99\u2013135 (1987)","journal-title":"RAIRO\u2013Theoretical Informatics and Applications"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15643-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:05:49Z","timestamp":1740524749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15643-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156427","9783642156434"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15643-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}