{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T06:10:03Z","timestamp":1736662203350,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11944836_30","type":"book-chapter","created":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T04:48:02Z","timestamp":1164689282000},"page":"321-332","source":"Crossref","is-referenced-by-count":5,"title":["Distributed Synthesis for Well-Connected Architectures"],"prefix":"10.1007","author":[{"given":"Paul","family":"Gastin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathalie","family":"Sznajder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Zeitoun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inform. Theory\u00a046(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"30_CR2","unstructured":"Church, A.: Logic, arithmetic, and automata. In: Int. Symp. of Mathematicians, pp. 23\u201335 (1962)"},{"key":"30_CR3","volume-title":"Proc. 20th IEEE Symp. on Logic in Computer Science (LICS 2005)","author":"B. Finkbeiner","year":"2005","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Proc. 20th IEEE Symp. on Logic in Computer Science (LICS 2005). IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Gastin, P., Sznajder, N., Zeitoun, M.: Distributed synthesis for well-connected architectures. Technical report, LSV (2006)","DOI":"10.1007\/11944836_30"},{"key":"30_CR5","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proceedings of LICS 2001. Computer Society Press (2001)"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/421091","volume":"5","author":"O. Kupferman","year":"1999","unstructured":"Kupferman, O., Vardi, M.Y.: Church\u2019s problem revisited. The Bulletin of Symbolic Logic\u00a05(2), 245\u2013263 (1999)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"30_CR7","first-page":"142","volume-title":"Proceedings of SODA 2004","author":"A.R. Lehman","year":"2004","unstructured":"Lehman, A.R., Lehman, E.: Complexity classification of network information flow problems. In: Proceedings of SODA 2004, pp. 142\u2013150. SIAM, Philadelphia (2004)"},{"key":"30_CR8","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.S.: Distributed controller 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)"},{"issue":"1","key":"30_CR9","first-page":"90","volume":"2","author":"D.E. Muller","year":"1995","unstructured":"Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. Theoret. Comput. Sci.\u00a02(1), 90\u2013121 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR10","first-page":"348","volume-title":"20th Annual Symposium on Foundations of Computer Science","author":"G. Peterson","year":"1979","unstructured":"Peterson, G., Reif, J.: Multiple-person alternation. In: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, pp. 348\u2013363. IEEE, New York (1979)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings of 31st IEEE Symp. FOCS, pp. 746\u2013757 (1990)","DOI":"10.1109\/FSCS.1990.89597"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:02:46Z","timestamp":1736658166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11944836_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}