{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T19:40:02Z","timestamp":1748979602585,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319395180"},{"type":"electronic","value":"9783319395197"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-39519-7_6","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T13:18:53Z","timestamp":1464095933000},"page":"84-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling Games for Concurrent Systems"],"prefix":"10.1007","author":[{"given":"Kasper","family":"Dokter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Shik","family":"Jongmans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhad","family":"Arbab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126, 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-24933-4_9","volume-title":"Formal Modeling: Actors, Open Systems, Biological Systems","author":"F Arbab","year":"2011","unstructured":"Arbab, F.: Puff, the magic protocol. In: Agha, G., Danvy, O., Meseguer, J. (eds.) Formal Modeling: Actors, Open Systems, Biological Systems. LNCS, vol. 7000, pp. 169\u2013206. Springer, Heidelberg (2011)"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.scico.2005.10.008","volume":"61","author":"C Baier","year":"2006","unstructured":"Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Programming 61(2), 75\u2013113 (2006)","journal-title":"Sci. Comput. Programming"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10617-012-9086-x","volume":"17","author":"MA Bamakhrama","year":"2013","unstructured":"Bamakhrama, M.A., Stefanov, T.P.: On the hard-real-time scheduling of embedded streaming applications. Des. Autom. Embed. Syst. 17(2), 221\u2013249 (2013)","journal-title":"Des. Autom. Embed. Syst."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-30538-5_13","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P., Cassez, F., Fleury, E., Larsen, K.G.: Optimal strategies in priced timed game automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 148\u2013160. Springer, Heidelberg (2004)"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.entcs.2004.07.006","volume":"119","author":"P Bouyer","year":"2005","unstructured":"Bouyer, P., Cassez, F., Fleury, E., Larsen, K.G.: Synthesis of optimal strategies using hytech. Electron. Notes Theor. Comput. Sci. 119(1), 11\u201331 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10703-010-0105-x","volume":"38","author":"L Brim","year":"2011","unstructured":"Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., Raskin, J.F.: Faster algorithms for mean-payoff games. Form. Method. Syst. Des. 38(2), 97\u2013118 (2011)","journal-title":"Form. Method. Syst. Des."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11539452_9","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"F Cassez","year":"2005","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 66\u201380. Springer, Heidelberg (2005)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-319-11737-9_5","volume-title":"Formal Methods and Software Engineering","author":"X Chen","year":"2014","unstructured":"Chen, X., Sun, J., Sun, M.: A hybrid model of connectors in cyber-physical systems. In: Merz, S., Pang, J. (eds.) ICFEM 2014. LNCS, vol. 8829, pp. 59\u201374. Springer, Heidelberg (2014)"},{"key":"6_CR10","first-page":"243","volume":"10","author":"M Crovella","year":"1999","unstructured":"Crovella, M., Frangioso, R., Harchol-Balter, M.: Connection scheduling in web servers. Proc. USITS 10, 243\u2013254 (1999)","journal-title":"Proc. USITS"},{"key":"6_CR11","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","volume-title":"Handbook of Weighted Automata","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series. Springer Science & Business Media, Heidelberg (2009)"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Theory 8(2), 109\u2013113 (1979)","journal-title":"Int. J. Game Theory"},{"key":"6_CR13","volume-title":"Work, Wages, and Profits","author":"HL Gantt","year":"1913","unstructured":"Gantt, H.L.: Work, Wages, and Profits. Engineering Magazine Co., New York (1913)"},{"key":"6_CR14","series-title":"NATO ASI Series","volume-title":"Verification of Digital and Hybrid Systems","author":"TA Henzinge","year":"2000","unstructured":"Henzinge, T.A.: The theory of hybrid automata. Verification of Digital and Hybrid Systems. NATO ASI Series. Springer, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Jha, N.K.: Low power system scheduling and synthesis. In: Proceedings of ICCAD, pp. 259\u2013263. IEEE (2001)","key":"6_CR15","DOI":"10.1109\/ICCAD.2001.968629"},{"doi-asserted-by":"crossref","unstructured":"Koehler, C., Clarke, D.: Decomposing port automata. In: Proceedings of SAC, pp. 1369\u20131373. ACM (2009)","key":"6_CR16","DOI":"10.1145\/1529282.1529587"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-59042-0_76","volume-title":"STACS 1995","author":"O Maler","year":"1995","unstructured":"Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, Ernst W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 229\u2013242. Springer, Heidelberg (1995)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-45937-5_14","volume-title":"Compiler Construction","author":"W Thies","year":"2002","unstructured":"Thies, W., Karczmarek, M., Amarasinghe, S.: StreamIt: a language for streaming applications. In: Nigel Horspool, R. (ed.) CC 2002. LNCS, vol. 2304, pp. 179\u2013196. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39519-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T19:11:27Z","timestamp":1748977887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39519-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319395180","9783319395197"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39519-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}