{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:15:36Z","timestamp":1756167336281,"version":"3.44.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"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":[],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/etfa.2012.6489567","type":"proceedings-article","created":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T16:57:59Z","timestamp":1365181079000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Response time bounds for static-priority tasks and arbitrary relative deadlines with resource augmentation"],"prefix":"10.1109","author":[{"given":"Pascal","family":"Richard","sequence":"first","affiliation":[{"name":"LIAS-University of Poitiers and ENSMA, France"}]},{"given":"Georges","family":"Kemayo","sequence":"additional","affiliation":[{"name":"LIAS-University of Poitiers and ENSMA, France"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Ridouard","sequence":"additional","affiliation":[{"name":"LIAS-University of Poitiers and ENSMA, France"}]},{"given":"Emmanuel","family":"Grolleau","sequence":"additional","affiliation":[{"name":"LIAS-University of Poitiers and ENSMA, France"}]},{"given":"Thi Huyen Ch\u00e2u","family":"Nguyen","sequence":"additional","affiliation":[{"name":"VNU - University of Engineering and Technology, Hanoï, Vietnam"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1998.739773"},{"key":"13","article-title":"Polynomial time approximate schedulability tests for fixed-priority real-time tasks: Some numerical experimentations","author":"richard","year":"2006","journal-title":"Proc Int Real-Time and Network Systems (RTNS'06)"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.66"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-009-9078-5"},{"key":"12","article-title":"The fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines revisited","author":"nguyen","year":"2010","journal-title":"Proc Int Conf on Real-Time and Network Systems (RTNS'10)"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.167"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-005-0507-9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1990.128748"},{"key":"1","article-title":"Efficient computation of response time bounds under fixed-priority scheduling","author":"bini","year":"2007","journal-title":"Proc Int Real-Time and Network Systems (RTNS'07)"},{"key":"7","first-page":"233","article-title":"A polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines","author":"fisher","year":"2005","journal-title":"Proc Int Conf on Real-Time and Network Systems (RTNS'05)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2005.1"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2008.25"},{"key":"4","article-title":"Initial values for on-line response time calculations","author":"bril","year":"2003","journal-title":"Proc 15th Euromicro Conf Real-time Systems (ECRTS '03)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/29.5.390"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"8"}],"event":{"name":"2012 IEEE 17th Conference on Emerging Technologies & Factory Automation (ETFA 2012)","start":{"date-parts":[[2012,9,17]]},"location":"Krakow, Poland","end":{"date-parts":[[2012,9,21]]}},"container-title":["Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6479732\/6489522\/06489567.pdf?arnumber=6489567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T20:18:26Z","timestamp":1756153106000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6489567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/etfa.2012.6489567","relation":{},"subject":[],"published":{"date-parts":[[2012,9]]}}}