{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:24:16Z","timestamp":1725891856067},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540472377"},{"type":"electronic","value":"9783540472384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11901914_20","type":"book-chapter","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T05:21:43Z","timestamp":1160457703000},"page":"245-259","source":"Crossref","is-referenced-by-count":2,"title":["Synthesis for Probabilistic Environments"],"prefix":"10.1007","author":[{"given":"Sven","family":"Schewe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0035748","volume-title":"Automata, Languages and Programming","author":"M. Abadi","year":"1989","unstructured":"Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable concurrent program specifications. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 1\u201317. Springer, Heidelberg (1989)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-58179-0_51","volume-title":"Computer Aided Verification","author":"A. Anuchitanukul","year":"1994","unstructured":"Anuchitanukul, A., Manna, Z.: Realizability and synthesis of reactive modules. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 156\u2013168. Springer, Heidelberg (1994)"},{"key":"20_CR3","first-page":"52","volume-title":"Proc. IBM Workshop on Logics of Programs","author":"E.M. Clarke","year":"1981","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proc. IBM Workshop on Logics of Programs, pp. 52\u201371. Springer, Heidelberg (1981)"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C. Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"J. ACM"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"de Alfaro, L.: From fairness to chance. In: Proc. PROBMIV 1998 (1999)","DOI":"10.1016\/S1571-0661(05)80597-3"},{"key":"20_CR6","first-page":"321","volume-title":"Proc. LICS","author":"B. Finkbeiner","year":"2005","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Proc. LICS, pp. 321\u2013330. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"20_CR7","first-page":"60","volume":"14","author":"Y. Gurevich","year":"1982","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata and games 14, 60\u201365 (1982)","journal-title":"Trees, automata and games"},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing\u00a06(5), 512\u2013535 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"20_CR9","unstructured":"Kupferman, O., Vardi, M.: Freedom, weakness, and determinism: From linear-time to branching-time. In: Proc. LICS (June 1995)"},{"key":"20_CR10","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesis with incomplete information. In: Proc. ICTL, Manchester, pp. 91\u2013106 (July 1997)"},{"issue":"2","key":"20_CR11","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":"20_CR12","first-page":"389","volume-title":"Proc. LICS 2001","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proc. LICS 2001, pp. 389\u2013398. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"20_CR13","first-page":"133","volume-title":"Proc. POPL 1981","author":"D. Lehmann","year":"1981","unstructured":"Lehmann, D., Rabin, M.O.: On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In: Proc. POPL 1981, pp. 133\u2013138. ACM Press, New York (1981)"},{"issue":"1-2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","volume":"141","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 the theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci.\u00a0141(1-2), 69\u2013107 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR15","first-page":"179","volume-title":"Proc. POPL","author":"A. Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. POPL, pp. 179\u2013190. ACM Press, New York (1989)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"Automata, Languages and Programming","author":"A. Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Automata, Languages and Programming, pp. 652\u2013671. Springer, Heidelberg (1989)"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0208013","volume":"8","author":"L.J. Stockmeyer","year":"1979","unstructured":"Stockmeyer, L.J., Chandra, A.K.: Provably difficult combinatorial games. SIAM J. Comput.\u00a08(2), 151\u2013174 (1979)","journal-title":"SIAM J. Comput."},{"key":"20_CR18","unstructured":"Wolper, P.: Synthesis of Communicating Processes from Temporal-Logic Specifications. PhD thesis, Stanford University (1982)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11901914_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:37:10Z","timestamp":1619509030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11901914_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540472377","9783540472384"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11901914_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}