{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:46:12Z","timestamp":1743065172020,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518301"},{"type":"electronic","value":"9783030518318"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51831-8_3","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T23:05:05Z","timestamp":1593471905000},"page":"46-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synthesis for Multi-weighted Games with Branching-Time Winning Conditions"],"prefix":"10.1007","author":[{"given":"Isabella","family":"Kaufmann","sequence":"first","affiliation":[]},{"given":"Kim Guldstrand","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"issue":"1\u201324","key":"3_CR1","first-page":"56","volume":"24","author":"S Almagor","year":"2016","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Formally reasoning about quality. J. ACM 24(1\u201324), 56 (2016)","journal-title":"J. ACM"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bauer, S.S., Juhl, L., Larsen, K.G., Srba, J., Legay, A.: A logic for accumulated-weight reasoning on multiweighted modal automata. In: TASE, pp. 77\u201384 (2012)","DOI":"10.1109\/TASE.2012.9"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02658-4_14","volume-title":"Computer Aided Verification","author":"R Bloem","year":"2009","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140\u2013156. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02658-4_14"},{"issue":"3\u20134","key":"3_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00236-013-0191-5","volume":"51","author":"R Bloem","year":"2013","unstructured":"Bloem, R., et al.: Synthesizing robust systems. Acta Inform. 51(3\u20134), 193\u2013220 (2013). \nhttps:\/\/doi.org\/10.1007\/s00236-013-0191-5","journal-title":"Acta Inform."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629686","volume":"27","author":"U Boker","year":"2014","unstructured":"Boker, U., Chatterjee, K., Henzinger, T.A., Kupferman, O.: Temporal specifications with accumulative values. TOCL 27, 1\u201327:25 (2014)","journal-title":"TOCL"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00236-016-0274-1","volume":"55","author":"P Bouyer","year":"2018","unstructured":"Bouyer, P., Markey, N., Randour, M., Larsen, K.G., Laursen, S.: Average-energy games. Acta Inform. 55, 91\u2013127 (2018)","journal-title":"Acta Inform."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-31424-7_8","volume-title":"Computer Aided Verification","author":"T Br\u00e1zdil","year":"2012","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Ku\u010dera, A., Novotn\u00fd, P.: Efficient controller synthesis for consumption games with multiple resource types. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 23\u201338. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31424-7_8"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2016.10.011","volume":"254","author":"V Bruy\u00e8re","year":"2017","unstructured":"Bruy\u00e8re, V., Filiot, E., Randour, M., Raskin, J.-F.: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games. Inf. Comput. 254, 259\u2013295 (2017)","journal-title":"Inf. Comput."},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Buchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. In: Mac Lane, S., Siefkes, D. (eds.) The Collected Works of J. Richard B\u00fcchi, pp. 525\u2013541. Springer, New York (1990). \nhttps:\/\/doi.org\/10.1007\/978-1-4613-8928-6_29","DOI":"10.1007\/978-1-4613-8928-6_29"},{"issue":"3\u20134","key":"3_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00236-013-0182-6","volume":"51","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Randour, M., Raskin, J.-F.: Strategy synthesis for multi-dimensional quantitative objectives. Acta Inform. 51(3\u20134), 129\u2013163 (2014)","journal-title":"Acta Inform."},{"key":"3_CR11","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payo and energy games. In: FSTTCS 2010. LiPIcs (2010)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H Galperin","year":"1983","unstructured":"Galperin, H., Wigderson, A.: Succinct representations of graphs. Inf. Control 56, 183\u2013198 (1983)","journal-title":"Inf. Control"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10009-014-0359-5","volume":"18","author":"JF Jensen","year":"2016","unstructured":"Jensen, J.F., Larsen, K.G., Srba, J., Oestergaard, L.K.: Efficient model checking of weighted CTL with upper-bound constraints. STTT 18(4), 409\u2013426 (2016)","journal-title":"STTT"},{"key":"3_CR14","unstructured":"Jensen, L.S., Kaufmann, I., Nielsen, S.M.: Symbolic synthesis of non-negative multi-weighted games with temporal objectives. Master thesis, Department of Computer Science, Aalborg University, Denmark (2017)"},{"key":"3_CR15","first-page":"28","volume":"105","author":"LS Jensen","year":"2019","unstructured":"Jensen, L.S., Kaufmann, I., Larsen, K.G., Nielsen, S.M., Srba, J.: Model checking and synthesis for branching multi-weighted logics. JLAMP 105, 28\u201346 (2019)","journal-title":"JLAMP"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-71209-1_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Jurdzi\u0144ski","year":"2007","unstructured":"Jurdzi\u0144ski, M., Laroussinie, F., Sproston, J.: Model checking probabilistic timed automata with one or two clocks. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 170\u2013184. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-71209-1_15"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-47666-6_21","volume-title":"Automata, Languages, and Programming","author":"M Jurdzi\u0144ski","year":"2015","unstructured":"Jurdzi\u0144ski, M., Lazi\u0107, R., Schmitz, S.: Fixed-dimensional energy games are in pseudo-polynomial time. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 260\u2013272. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-47666-6_21"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/3-540-44612-5_45","volume-title":"Mathematical Foundations of Computer Science 2000","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y.: $$\\mu $$\u2013calculus synthesis. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 497\u2013507. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-44612-5_45"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-44618-4_9","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Madhusudan, P., Thiagarajan, P.S., Vardi, M.Y.: Open systems in reactive environments: control and synthesis. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 92\u2013107. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-44618-4_9"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-94-015-9586-5_6","volume-title":"Advances in Temporal Logic","author":"O Kupfermant","year":"2000","unstructured":"Kupfermant, O., Vardi, M.Y.: Synthesis with incomplete information. In: Barringer, H., Fisher, M., Gabbay, D., Gough, G. (eds.) Advances in Temporal Logic, vol. 16, pp. 109\u2013127. Springer, Netherlands (2000). \nhttps:\/\/doi.org\/10.1007\/978-94-015-9586-5_6"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.tcs.2005.11.020","volume":"353","author":"F Laroussinie","year":"2006","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Efficient timed model checking for discrete-time systems. Theor. Comput. Sci. 353, 249\u2013271 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.entcs.2015.12.018","volume":"319","author":"KG Larsen","year":"2015","unstructured":"Larsen, K.G., Mardare, R., Xue, B.: Alternation-free weighted mu-calculus: decidability and completeness. Electron. Notes Theor. Comput. Sci. 319, 289\u2013313 (2015)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0055040","volume-title":"Automata, Languages and Programming","author":"X Liu","year":"1998","unstructured":"Liu, X., Smolka, S.A.: Simple linear-time algorithms for minimal fixed points. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 53\u201366. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0055040"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL 1989, pp. 179\u2013190. ACM (1989)","DOI":"10.1145\/75277.75293"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","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: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652\u2013671. Springer, Heidelberg (1989). \nhttps:\/\/doi.org\/10.1007\/BFb0035790"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Ramadge, P.J.G., Wonham, W.M.: The control of discrete event systems. In: Proceedings of the IEEE, pp. 81\u201398 (1989)","DOI":"10.1109\/5.21072"},{"key":"3_CR27","unstructured":"Le Roux, S., Pauly, A., Randour, M.: Extending finite-memory determinacy by boolean combination of winning conditions. In: FSTTCS 2018, LIPIcs. vol. 122, pp. 38:1\u201338:20 (2018)"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-60045-0_56","volume-title":"Computer Aided Verification","author":"MY Vardi","year":"1995","unstructured":"Vardi, M.Y.: An automata-theoretic approach to fair realizability and synthesis. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 267\u2013278. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/3-540-60045-0_56"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51831-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T00:05:14Z","timestamp":1593475514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51831-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518301","9783030518318"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51831-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf-2020.petrinet.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.89","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}