{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:25:56Z","timestamp":1761323156838,"version":"3.43.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Systems"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1007980022314","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T07:13:40Z","timestamp":1040541220000},"page":"107-126","source":"Crossref","is-referenced-by-count":35,"title":["The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems"],"prefix":"10.1007","volume":"13","author":[{"given":"J.","family":"Goossens","sequence":"first","affiliation":[]},{"given":"R.","family":"Devillers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"136839_CR1","first-page":"284","volume":"8","author":"N. Audsley","year":"1993","unstructured":"Audsley, N., Burns, A., Richardson, M., Tindell, K. and Wellings, A.J. Applying new scheduling theory to static priority pre-emptive scheduling. IEEE\nTransaction on Software Engineering, 8(5):284-292, 1993.","journal-title":"Transaction on Software Engineering"},{"key":"136839_CR2","volume-title":"Optimal priority assignment and feasibility of static priority tasks with arbitrary start times","author":"N.C. Audsley","year":"1991","unstructured":"Audsley, N.C. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical report, University of York, England, 1991."},{"key":"136839_CR3","unstructured":"Goossens, J. Priority assignment and offset assignment for hard real-time offset free systems. In DARTS'95, workshop on Design and Analysis of Real-Time Systems. Universit\u00e9 Libre de Bruxelles, November 1995."},{"issue":"3","key":"136839_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(80)90123-4","volume":"11","author":"Leung","year":"1980","unstructured":"Leung, Joseph Y.-T. and Merrill, M.L. A note on preemptive scheduling of periodic, real-time tasks. Information Processing Letters, 11(3):115-118, November 1980.","journal-title":"Information Processing Letters"},{"key":"136839_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","volume":"2","author":"J. Y. Leung","year":"1982","unstructured":"Leung, Joseph Y.-T. and Whitehead, Jennifer. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2:237-250, 1982.","journal-title":"Performance Evaluation"},{"issue":"1","key":"136839_CR6","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C.L. Liu","year":"1973","unstructured":"Liu, C.L. and Layland, James W. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery, 20(1):46-61, January 1973.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"136839_CR7","unstructured":"Serlin, Omri. Scheduling of time critical processes. In the 1972 Spring Joint Computer Conference, volume 40 of AFIPS\nConference Proceedings, 1972."},{"key":"136839_CR8","volume-title":"Adding time-offsets to schedulability analysis","author":"K.W. Tindell","year":"1994","unstructured":"Tindell, K.W. Adding time-offsets to schedulability analysis. Technical report, University of York, England, 1994a."},{"key":"136839_CR9","doi-asserted-by":"crossref","unstructured":"Tindell, K.W. An extensible approach for analysing fixed priority hard real-time tasks. The Journal of Real-Time Systems, 6(2), March 1994b.","DOI":"10.1007\/BF01088593"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007980022314.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007980022314\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007980022314.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T07:09:21Z","timestamp":1754636961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007980022314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["136839"],"URL":"https:\/\/doi.org\/10.1023\/a:1007980022314","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}