{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T04:08:29Z","timestamp":1745035709872,"version":"3.40.4"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Embedded Syst. Lett."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/les.2024.3498932","type":"journal-article","created":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T18:38:48Z","timestamp":1731609528000},"page":"119-122","source":"Crossref","is-referenced-by-count":0,"title":["Lustre, Fast First, and Fresh"],"prefix":"10.1109","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0601-4182","authenticated-orcid":false,"given":"Timothy","family":"Bourke","sequence":"first","affiliation":[{"name":"Inria, Paris, France"}]},{"given":"Marc","family":"Pouzet","sequence":"additional","affiliation":[{"name":"Inria, Paris, France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/5.97300"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45212-6_10"},{"key":"ref3","first-page":"1","article-title":"Scheduling and compiling rate-synchronous programs with end-to-end latency constraints","volume-title":"Proc. 35th ECRTS","author":"Bourke"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2010.26"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774196"},{"key":"ref6","first-page":"1","article-title":"Polyhedral scheduling and relaxation of synchronous reactive systems","volume-title":"Proc. 12th IMPACT","author":"Iooss"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111054"},{"volume-title":"Lucid Synchrone, Version 3. Tutorial and Reference Manual","year":"2006","author":"Pouzet","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1379023.1375674"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35182-2_16"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.6.1195"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3446429"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3545001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"}],"container-title":["IEEE Embedded Systems Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4563995\/10969144\/10753468.pdf?arnumber=10753468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T17:38:13Z","timestamp":1744997893000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10753468\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":14,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/les.2024.3498932","relation":{},"ISSN":["1943-0663","1943-0671"],"issn-type":[{"type":"print","value":"1943-0663"},{"type":"electronic","value":"1943-0671"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}