{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:15Z","timestamp":1760202675729,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445839"},{"type":"electronic","value":"9783662445846"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44584-6_12","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:21:03Z","timestamp":1408756863000},"page":"156-172","source":"Crossref","is-referenced-by-count":5,"title":["Synthesis from Component Libraries with Costs"],"prefix":"10.1007","author":[{"given":"Guy","family":"Avni","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_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":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-39212-2_3","volume-title":"Automata, Languages, and Programming","author":"S. Almagor","year":"2013","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 15\u201327. Springer, Heidelberg (2013)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Alonso, G., Casati, F., Kuno, H.A., Machiraju, V.: Web Services - Concepts, Architectures and Applications. In: Data-Centric Systems and Applications. Springer (2004)","DOI":"10.1007\/978-3-662-10876-5"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-24730-2_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 467\u2013481. Springer, Heidelberg (2004)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.ipl.2013.09.007","volume":"113","author":"G. Avni","year":"2013","unstructured":"Avni, G., Kupferman, O.: When does abstraction help? IPL\u00a0113, 901\u2013905 (2013)","journal-title":"IPL"},{"key":"12_CR6","unstructured":"Avni, G., Kupferman, O., Tamir, T.: Congestion and cost-sharing games with multisets of resources (submitted, 2014)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Avni, G., Kupferman, O., Tamir, T.: Network-formation games with regular objectives. In: Muscholl, A. (ed.) FOSSACS 2014. LNCS, vol.\u00a08412, pp. 119\u2013133. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54830-7_8"},{"key":"12_CR8","unstructured":"Berwanger, D., Doyen, L.: On the power of imperfect information. In: Proc. 28th TST& TCS, pp. 73\u201382 (2008)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Bohy, A., Bruy\u00e8re, V., Filiot, E., Raskin, J.-F.: Synthesis from LTL specifications with mean-payoff objectives. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol.\u00a07795, pp. 169\u2013184. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-36742-7_12"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Boker, U., Chatterjee, K., Henzinger, T.A., Kupferman, O.: Temporal specifications with accumulative values. In: Proc. 26th LICS, pp. 43\u201352 (2011)","DOI":"10.1109\/LICS.2011.33"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2005.07.033","volume":"345","author":"L. Alfaro de","year":"2005","unstructured":"de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Model checking discounted temporal properties. TCS\u00a0345(1), 139\u2013170 (2005)","journal-title":"TCS"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-45449-7_11","volume-title":"Embedded Software","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface theories for component-based design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol.\u00a02211, pp. 148\u2013165. Springer, Heidelberg (2001)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Doyen, L., Henzinger, T.A., Jobstmann, B., Petrov, T.: Interface theories with component reuse. In: Proc. 8th EMSOFT, pp. 79\u201388 (2008)","DOI":"10.1145\/1450058.1450070"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/BFb0028773","volume-title":"Computer Aided Verification","author":"J. Elgaard","year":"1998","unstructured":"Elgaard, J., Klarlund, N., M\u00f6ller, A.: Mona 1.x: New techniques for WS1S and WS2S. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol.\u00a01427, pp. 516\u2013520. Springer, Heidelberg (1998)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proc. 36th STOC, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"3","key":"12_CR16","first-page":"61","volume":"220","author":"M. Faella","year":"2008","unstructured":"Faella, M., Legay, A., Stoelinga, M.: Model checking quantitative linear time logic. ENTCS\u00a0220(3), 61\u201377 (2008)","journal-title":"ENTCS"},{"issue":"3","key":"12_CR17","first-page":"261","volume":"39","author":"E. Filiot","year":"2011","unstructured":"Filiot, E., Jin, N., Raskin, J.-F.: Antichains and compositional algorithms for LTL synthesis. FMSD\u00a039(3), 261\u2013296 (2011)","journal-title":"FMSD"},{"issue":"1-3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.scico.2004.05.014","volume":"55","author":"G. G\u00f6\u00dfler","year":"2005","unstructured":"G\u00f6\u00dfler, G., Sifakis, J.: Composition for component-based modeling. Sci. Comput. Program.\u00a055(1-3), 161\u2013183 (2005)","journal-title":"Sci. Comput. Program."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Ko, K.-I., Lin, C.-L.: On the complexity of min-max optimization problems and their approximation. In: Minimax and Applications. Nonconvex Optimization and Its Applications, vol.\u00a04, pp. 219\u2013239. Springer (1995)","DOI":"10.1007\/978-1-4613-3557-3_15"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/11817963_6","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"2006","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: Safraless compositional synthesis. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 31\u201344. Springer, Heidelberg (2006)"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: Proc. 46th FOCS, pp. 531\u2013540 (2005)","DOI":"10.1109\/SFCS.2005.66"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10009-012-0236-z","volume":"15","author":"Y. Lustig","year":"2013","unstructured":"Lustig, Y., Vardi, M.Y.: Synthesis from component libraries. STTT\u00a015, 603\u2013618 (2013)","journal-title":"STTT"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th POPL, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Raskin, J.-F., Chatterjee, K., Doyen, L., Henzinger, T.: Algorithms for \u03c9-regular games with imperfect information. LMCS\u00a03(3) (2007)","DOI":"10.2168\/LMCS-3(3:4)2007"},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? JACM\u00a049(2), 236\u2013259 (2002)","journal-title":"JACM"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: Proc. 29th FOCS, pp. 319\u2013327 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logic. JACM\u00a032, 733\u2013749 (1985)","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2014 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44584-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:40:59Z","timestamp":1746351659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44584-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445839","9783662445846"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44584-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}