{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:18:17Z","timestamp":1767035897830,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,28]]},"DOI":"10.1145\/3742875.3754684","type":"proceedings-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:13:02Z","timestamp":1767031982000},"page":"81-85","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimising the Scheduling of System Level Logical Execution Time Systems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7734-4608","authenticated-orcid":false,"given":"Jamie","family":"Lee","sequence":"first","affiliation":[{"name":"Computer and Information Sciences Department, Auckland University of Technology, Auckland, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7876-819X","authenticated-orcid":false,"given":"Nathan","family":"Allen","sequence":"additional","affiliation":[{"name":"Computer and Information Sciences Department, Auckland University of Technology, Auckland, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7269-5874","authenticated-orcid":false,"given":"Matthew M. Y.","family":"Kuo","sequence":"additional","affiliation":[{"name":"Computer and Information Sciences Department, Auckland University of Technology, Auckland, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2840-6567","authenticated-orcid":false,"given":"Eugene","family":"Yip","sequence":"additional","affiliation":[{"name":"GLIWA GmbH & Co. KG, Oberbayern, Germany"}]}],"member":"320","published-online":{"date-parts":[[2025,12,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2017.09.004"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IECON.2018.8592842"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3358181"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/EMSOFT55006.2022.00017"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.23919\/DATE51398.2021.9474257"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3703630"},{"key":"e_1_3_2_1_7_1","volume-title":"Optimal Task Phasing for End-To-End Latency in Harmonic and Semi-Harmonic Automotive Systems. In IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) (preprint). IEEE","author":"G\u00fcnzel Mario","year":"2025","unstructured":"Mario G\u00fcnzel and Matthias Becker. 2025. Optimal Task Phasing for End-To-End Latency in Harmonic and Semi-Harmonic Automotive Systems. In IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) (preprint). IEEE, New York City, USA, 13 pages."},{"key":"e_1_3_2_1_8_1","volume-title":"Kirsch and Ana Sokolova","author":"Christoph","year":"2012","unstructured":"Christoph M. Kirsch and Ana Sokolova. 2012. The Logical Execution Time Paradigm. In Advances in Real-Time Systems. Springer, Berlin, Heidelberg, 103\u2013120."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3573388"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ECRTS.2020.20"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2857398"},{"key":"e_1_3_2_1_12_1","first-page":"25","article-title":"Pulp: a linear programming toolkit for python. The University of Auckland, Auckland","volume":"65","author":"Mitchell Stuart","year":"2011","unstructured":"Stuart Mitchell, Michael OSullivan, and Iain Dunning. 2011. Pulp: a linear programming toolkit for python. The University of Auckland, Auckland, New Zealand 65 (2011), 25.","journal-title":"New Zealand"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS46320.2019.00028"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879021.1879039"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIES.2018.8442077"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2022.3197082"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS61025.2024.00019"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Shumo Wang Yuhan Lin Zhiwei Feng Maoyang Shan Qingxu Deng and Zonghua Gu. 2024. End-to-End Timing Analysis of Task Chains for TSN-Based Distributed Real-Time Systems Based on IEEE 802.1Qcr. Technical Report. North-eastern University Shengyang China. 10.2139\/ssrn.5096121","DOI":"10.2139\/ssrn.5096121"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3575757.3593658"}],"event":{"name":"MEMOCODE '25: International Symposium on Formal Methods and Models for System Design","sponsor":["SIGDA ACM Special Interest Group on Design Automation","SIGBED ACM Special Interest Group on Embedded Systems","IEEE CAS","IEEE CEDA"],"location":"Taipei International Convention Center (TICC) Taipei Taiwan","acronym":"MEMOCODE '25"},"container-title":["Proceedings of the International Symposium on Formal Methods and Models for System Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3742875.3754684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:15:50Z","timestamp":1767035750000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3742875.3754684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,28]]},"references-count":19,"alternative-id":["10.1145\/3742875.3754684","10.1145\/3742875"],"URL":"https:\/\/doi.org\/10.1145\/3742875.3754684","relation":{},"subject":[],"published":{"date-parts":[[2025,9,28]]},"assertion":[{"value":"2025-12-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}