{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:22:53Z","timestamp":1779074573964,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662466803","type":"print"},{"value":"9783662466810","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46681-0_50","type":"book-chapter","created":{"date-parts":[[2015,3,30]],"date-time":"2015-03-30T22:56:36Z","timestamp":1427756196000},"page":"517-532","source":"Crossref","is-referenced-by-count":18,"title":["Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information"],"prefix":"10.1007","author":[{"given":"Roderick","family":"Bloem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swen","family":"Jacobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"K\u00f6nighofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1145\/320613.320614","volume":"5","author":"C. Beeri","year":"1980","unstructured":"Beeri, C.: On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. on Database Systems\u00a05, 241\u2013259 (1980)","journal-title":"ACM Trans. on Database Systems"},{"issue":"10","key":"50_CR2","first-page":"1206","volume":"208","author":"D. Berwanger","year":"2010","unstructured":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., Henzinger, T.A.: Strategy construction for parity games with imperfect information. I& C\u00a0208(10), 1206\u20131220 (2010)","journal-title":"I& C"},{"key":"50_CR3","unstructured":"Bloem, R., Chatterjee, K., Jacobs, S., K\u00f6nighofer, R.: Assume-guarantee synthesis for concurrent reactive programs with partial information. CoRR, abs\/1411.4604 (2014)"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Brenguier, R., Raskin, J.F., Sassolas, M.: The complexity of admissibility in omega-regular games. In: CSL-LICS, ACM (2014)","DOI":"10.1145\/2603088.2603143"},{"key":"50_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Transactions of the AMS\u00a0138, 295\u2013311 (1969)","journal-title":"Transactions of the AMS"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1007\/978-3-642-39799-8_68","volume-title":"Computer Aided Verification","author":"P. \u010cern\u00fd","year":"2013","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A., Ryzhyk, L., Tarrach, T.: Efficient synthesis for concurrency by semantics-preserving transformations. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 951\u2013967. Springer, Heidelberg (2013)"},{"key":"50_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-54013-4_5","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"K. Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L., Filiot, E., Raskin, J.-F.: Doomsday equilibria for omega-regular games. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol.\u00a08318, pp. 78\u201397. Springer, Heidelberg (2014)"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games of incomplete information. In: Logical Methods in Computer Science, vol.\u00a03(3:4) (2007)","DOI":"10.2168\/LMCS-3(3:4)2007"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-71209-1_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A.: Assume-guarantee synthesis. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 261\u2013275. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"50_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.032","volume":"365","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Games with secure equilibria. Theor. Comput. Sci.\u00a0365(1-2), 67\u201382 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J., Pavlogiannis, A.: Distributed synthesis for LTL fragments. In: FMCAD, pp. 18\u201325. IEEE (2013)","DOI":"10.1109\/FMCAD.2013.6679386"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., K\u00f6\u00dfler, A., Schmid, U.: Automated analysis of real-time scheduling using graph games. In: HSCC, pp. 163\u2013172. ACM (2013)","DOI":"10.1145\/2461328.2461356"},{"issue":"4","key":"50_CR13","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s00165-013-0283-6","volume":"26","author":"K. Chatterjee","year":"2014","unstructured":"Chatterjee, K., Raman, V.: Assume-guarantee synthesis for digital contract signing. Formal Asp. Comput.\u00a026(4), 825\u2013859 (2014)","journal-title":"Formal Asp. Comput."},{"key":"50_CR14","unstructured":"Church, A.: Logic, arithmetic, and automata. In: Proceedings of the International Congress of Mathematicians, pp. 23\u201335 (1962)"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model checking. MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50026-6"},{"key":"50_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-27940-9_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B. Finkbeiner","year":"2012","unstructured":"Finkbeiner, B., Jacobs, S.: Lazy synthesis. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol.\u00a07148, pp. 219\u2013234. Springer, Heidelberg (2012)"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: LICS, IEEE (2005)","DOI":"10.1007\/11562948_21"},{"issue":"5-6","key":"50_CR18","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10009-012-0228-z","volume":"15","author":"B. Finkbeiner","year":"2013","unstructured":"Finkbeiner, B., Schewe, S.: Bounded synthesis. STTT\u00a015(5-6), 519\u2013539 (2013)","journal-title":"STTT"},{"key":"50_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-12002-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Fisman","year":"2010","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 190\u2013204. Springer, Heidelberg (2010)"},{"key":"50_CR20","doi-asserted-by":"crossref","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci, 111\u2013121 (1980)","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"50_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"50_CR22","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC, pp. 60\u201365. ACM (1982)","DOI":"10.1145\/800070.802177"},{"key":"50_CR23","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","volume":"22","author":"N. Immerman","year":"1981","unstructured":"Immerman, N.: Number of quantifiers is better than number of tape cells. J. Comput. Syst. Sci.\u00a022, 384\u2013406 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"50_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-29963-6_10","volume-title":"Security and Trust Management","author":"W. Jamroga","year":"2012","unstructured":"Jamroga, W., Mauw, S., Melissen, M.: Fairness in non-repudiation protocols. In: Meadows, C., Fernandez-Gago, C. (eds.) STM 2011. LNCS, vol.\u00a07170, pp. 122\u2013139. Springer, Heidelberg (2012)"},{"issue":"2","key":"50_CR25","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.jcss.2011.05.005","volume":"78","author":"B. Jobstmann","year":"2012","unstructured":"Jobstmann, B., Staber, S., Griesmayer, A., Bloem, R.: Finding and fixing faults. J. Comput. Syst. Sci.\u00a078(2), 441\u2013460 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"50_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1007\/978-3-642-39799-8_66","volume-title":"Computer Aided Verification","author":"A. Khalimov","year":"2013","unstructured":"Khalimov, A., Jacobs, S., Bloem, R.: PARTY parameterized synthesis of token rings. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 928\u2013933. Springer, Heidelberg (2013)"},{"key":"50_CR27","unstructured":"Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: FOCS (2005)"},{"key":"50_CR28","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)"},{"key":"50_CR29","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proceedings of the National Academny of Sciences USA\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academny of Sciences USA"},{"key":"50_CR30","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)"},{"key":"50_CR31","doi-asserted-by":"crossref","unstructured":"Peterson, G.L., Reif, J.H.: Multiple-person alternation. In: FOCS. IEEE (1979)","DOI":"10.1109\/SFCS.1979.25"},{"key":"50_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11609773_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"N. Piterman","year":"2006","unstructured":"Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive(1) designs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 364\u2013380. Springer, Heidelberg (2006)"},{"key":"50_CR33","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL (1989)","DOI":"10.1145\/75277.75293"},{"key":"50_CR34","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: FOCS, pp. 746\u2013757. IEEE (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"50_CR35","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Automata on Infinite Objects and Churchs Problem. American Mathematical Society (1972)","DOI":"10.1090\/cbms\/013"},{"issue":"2","key":"50_CR36","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. J. Comput. Syst. Sci.\u00a029(2), 274\u2013301 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"50_CR37","first-page":"177","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. JCSS\u00a04(2), 177\u2013192 (1970)","journal-title":"JCSS"},{"issue":"4","key":"50_CR38","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ipl.2013.11.012","volume":"114","author":"S. Schewe","year":"2014","unstructured":"Schewe, S.: Distributed synthesis is simply undecidable. IPL\u00a0114(4), 203\u2013207 (2014)","journal-title":"IPL"},{"issue":"5-6","key":"50_CR39","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10009-012-0249-7","volume":"15","author":"A. Solar-Lezama","year":"2013","unstructured":"Solar-Lezama, A.: Program sketching. STTT\u00a015(5-6), 475\u2013495 (2013)","journal-title":"STTT"},{"key":"50_CR40","doi-asserted-by":"crossref","unstructured":"Vechev, M.T., Yahav, E., Yorsh, G.: Abstraction-guided synthesis of synchronization. In: POPL, pp. 327\u2013338. ACM (2010)","DOI":"10.1145\/1707801.1706338"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46681-0_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T19:25:58Z","timestamp":1747855558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46681-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466803","9783662466810"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46681-0_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}