{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T22:41:38Z","timestamp":1760568098171,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030892463"},{"type":"electronic","value":"9783030892470"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89247-0_1","type":"book-chapter","created":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T17:24:40Z","timestamp":1634405080000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Protocol Scheduling"],"prefix":"10.1007","author":[{"given":"Kasper","family":"Dokter","sequence":"first","affiliation":[]},{"given":"Farhad","family":"Arbab","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,17]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Automata, Languages and Programming","author":"R Alur","year":"1990","unstructured":"Alur, R., Dill, D.: Automata for modeling real-time systems. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322\u2013335. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032042"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1017\/S0960129504004153","volume":"14","author":"F Arbab","year":"2004","unstructured":"Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329\u2013366 (2004). https:\/\/doi.org\/10.1017\/S0960129504004153","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1\u20133","key":"1_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2004.05.010","volume":"55","author":"F Arbab","year":"2005","unstructured":"Arbab, F.: Abstract behavior types: a foundation model for components and their composition. Sci. Comput. Program. 55(1\u20133), 3\u201352 (2005). https:\/\/doi.org\/10.1016\/j.scico.2004.05.010","journal-title":"Sci. Comput. Program."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-30734-3_7","volume-title":"Theory and Practice of Formal Methods","author":"F Arbab","year":"2016","unstructured":"Arbab, F.: Proper protocol. In: \u00c1brah\u00e1m, E., Bonsangue, M., Johnsen, E.B. (eds.) Theory and Practice of Formal Methods. LNCS, vol. 9660, pp. 65\u201387. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30734-3_7"},{"key":"1_CR5","unstructured":"Bamakhrama, M.A.M.: On hard real-time scheduling of cyclo-static dataflow and its application in system-level design. Ph.D. thesis, Leiden University (2014)"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bloem, R., Greimel, K., Henzinger, T.A., Jobstmann, B.: Synthesizing robust systems. In: Proceedings of FMCAD, pp. 85\u201392. IEEE (2009). https:\/\/doi.org\/10.1109\/FMCAD.2009.5351139","DOI":"10.1109\/FMCAD.2009.5351139"},{"issue":"2","key":"1_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.: Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38(2), 97\u2013118 (2011). https:\/\/doi.org\/10.1007\/s10703-010-0105-x","journal-title":"Formal Methods Syst. Des."},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/s00453-016-0123-1","volume":"77","author":"C Comin","year":"2017","unstructured":"Comin, C., Rizzi, R.: Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games. Algorithmica 77(4), 995\u20131021 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0123-1","journal-title":"Algorithmica"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-68953-1_6","volume-title":"Topics in Theoretical Computer Science","author":"K Dokter","year":"2017","unstructured":"Dokter, K., Arbab, F.: Exposing latent mutual exclusion by work automata. In: Mousavi, M.R., Sgall, J. (eds.) TTCS 2017. LNCS, vol. 10608, pp. 59\u201373. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68953-1_6"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-39519-7_6","volume-title":"Coordination Models and Languages","author":"K Dokter","year":"2016","unstructured":"Dokter, K., Jongmans, S.-S., Arbab, F.: Scheduling games for concurrent systems. In: Lluch Lafuente, A., Proen\u00e7a, J. (eds.) COORDINATION 2016. LNCS, vol. 9686, pp. 84\u2013100. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39519-7_6"},{"issue":"2","key":"1_CR11","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"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2006.02.012","volume":"356","author":"RJ van Glabbeek","year":"2006","unstructured":"van Glabbeek, R.J.: On the expressiveness of higher dimensional automata. Theor. Comput. Sci. 356(3), 265\u2013290 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.02.012","journal-title":"Theor. Comput. Sci."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Goubault, E.: Schedulers as abstract interpretations of higher-dimensional automata. In: Proceedings of the of PEPM, pp. 134\u2013145. ACM (1995)","DOI":"10.1145\/215465.215577"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Martin, D.A.: Borel determinacy. Ann. Math. 363\u2013371 (1975)","DOI":"10.2307\/1971035"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Pratt, V.R.: Modeling concurrency with geometry. In: Wise, D.S. (ed.) Proceedings of POPL, pp. 311\u2013322. ACM Press (1991). https:\/\/doi.org\/10.1145\/99583.99625","DOI":"10.1145\/99583.99625"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89247-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T22:02:52Z","timestamp":1760565772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89247-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030892463","9783030892470"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89247-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FSEN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamentals of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fsen2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fsen.ir\/2021\/","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":"38","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":"12","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":"4","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":"32% - 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":"3","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 hosted by IPM.","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)"}}]}}