{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:52:39Z","timestamp":1743090759033,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030597610"},{"type":"electronic","value":"9783030597627"}],"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-59762-7_6","type":"book-chapter","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T23:08:26Z","timestamp":1601420906000},"page":"73-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Schedulability as a Search Space Problem with Decision Diagrams"],"prefix":"10.1007","author":[{"given":"Dimitri","family":"Racordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lien","family":"Coet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanouela","family":"Stachtiari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"Buchs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,30]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Baro, J., Boniol, F., Cordovilla, M., Noulard, E., Pagetti, C.: Off-line (optimal) multiprocessor scheduling of dependent periodic tasks. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, pp. 1815\u20131820 (2012)","DOI":"10.1145\/2245276.2232071"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1059816.1059823","volume":"32","author":"G Behrmann","year":"2005","unstructured":"Behrmann, G., Larsen, K.G., Rasmussen, J.I.: Optimal scheduling using priced timed automata. SIGMETRICS Perform. Eval. Rev. 32(4), 34\u201340 (2005)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"6_CR3","series-title":"Artificial Intelligence: Foundations, Theory, and Algorithms","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9","volume-title":"Decision Diagrams for Optimization","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cir\u00e9, A.A., van Hoeve, W., Hooker, J.N.: Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-42849-9"},{"issue":"8","key":"6_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1287\/opre.2013.1221","volume":"61","author":"AA Cire","year":"2013","unstructured":"Cire, A.A., van Hoeve, W.J.: Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6), 1411\u20131428 (2013)","journal-title":"Oper. Res."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-48068-4_8","volume-title":"Application and Theory of Petri Nets 2002","author":"J-M Couvreur","year":"2002","unstructured":"Couvreur, J.-M., Encrenaz, E., Paviot-Adet, E., Poitrenaud, D., Wacrenier, P.-A.: Data decision diagrams for petri net analysis. In: Esparza, J., Lakos, C. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 101\u2013120. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-48068-4_8"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10009-014-0331-4","volume":"17","author":"A David","year":"2015","unstructured":"David, A., Larsen, K.G., Legay, A., Mikucionis, M.: Schedulability of Herschel revisited using statistical model checking. Int. J. Softw. Tools Technol. Transfer 17(2), 187\u2013199 (2015). \nhttps:\/\/doi.org\/10.1007\/s10009-014-0331-4","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-75664-4_26","volume-title":"Software Technologies for Embedded and Ubiquitous Systems","author":"N Guan","year":"2007","unstructured":"Guan, N., Gu, Z., Deng, Q., Gao, S., Yu, G.: Exact schedulability analysis for static-priority global multiprocessor scheduling using model-checking. In: Obermaisser, R., Nah, Y., Puschner, P., Rammig, F.J. (eds.) SEUS 2007. LNCS, vol. 4761, pp. 263\u2013272. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-75664-4_26"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-29072-5_5","volume":"5","author":"S Hong","year":"2012","unstructured":"Hong, S., Kordon, F., Paviot-Adet, E., Evangelista, S.: Computing a hierarchical static order for decision diagram-based representation from P\/T nets. Trans. Petri Nets Other Models Concurr. 5, 121\u2013140 (2012)","journal-title":"Trans. Petri Nets Other Models Concurr."},{"key":"6_CR10","unstructured":"Jensen, A.R., Lauritzen, L.B., Laursen, O.: Optimal task graph scheduling with binary decision diagrams (2004)"},{"issue":"9","key":"6_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/0141-9331(94)90073-6","volume":"18","author":"B Korousic-Seljak","year":"1994","unstructured":"Korousic-Seljak, B.: Task scheduling policies for real-time systems. Microprocess. Microsyst. 18(9), 501\u2013511 (1994)","journal-title":"Microprocess. Microsyst."},{"key":"6_CR12","unstructured":"Lehoczky, J.P., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Real-Time Systems Symposium, pp. 166\u2013171. IEEE Computer Society (1989)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Linard, A., Paviot-Adet, E., Kordon, F., Buchs, D., Charron, S.: polydd: towards a framework generalizing decision diagrams. In: Gomes, L., Khomenko, V., Fernandes, J.M. (eds.) International Conference on Application of Concurrency to System Design, pp. 124\u2013133. IEEE Computer Society, New York (2010)","DOI":"10.1109\/ACSD.2010.17"},{"key":"6_CR14","unstructured":"Mahadevan, S., Storgaard, M., Madsen, J., Virk, K.: ARTS: a system-level framework for modeling MPSoC components and analysis of their causality. In: International Symposium on Modeling, pp. 480\u2013483. IEEE Computer Society (2005)"},{"key":"6_CR15","unstructured":"Nguyen, V.A., Hardy, D., Puaut, I.: Cache-conscious offline real-time task scheduling for multi-core processors. In: 29th Euromicro Conference on Real-time Systems (ECRTS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"5","key":"6_CR16","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/s11241-015-9232-1","volume":"51","author":"W Puffitsch","year":"2015","unstructured":"Puffitsch, W., Noulard, E., Pagetti, C.: Off-line mapping of multi-rate dependent task sets to many-core platforms. Real-Time Syst. 51(5), 526\u2013565 (2015). \nhttps:\/\/doi.org\/10.1007\/s11241-015-9232-1","journal-title":"Real-Time Syst."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-45892-2_4","volume-title":"Software Engineering for Resilient Systems","author":"D Racordon","year":"2016","unstructured":"Racordon, D., Buchs, D.: Verifying multi-core schedulability with data decision diagrams. In: Crnkovic, I., Troubitsyna, E. (eds.) SERENE 2016. LNCS, vol. 9823, pp. 45\u201361. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-45892-2_4"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Yalcinkaya, B., Nasri, M., Brandenburg, B.B.: An exact schedulability test for non-preemptive self-suspending real-time tasks. In: Teich, J., Fummi, F. (eds.) Design, Automation & Test in Europe, pp. 1228\u20131233. IEEE (2019)","DOI":"10.23919\/DATE.2019.8715111"}],"container-title":["Lecture Notes in Computer Science","Search-Based Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59762-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T23:17:49Z","timestamp":1601421469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59762-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030597610","9783030597627"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59762-7_6","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 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSBSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Search Based Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"7 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ssbse2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssbse2020.di.uniba.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"34","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":"13","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":"5","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":"38% - 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)"}}]}}