{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:19Z","timestamp":1725455479440},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631019"},{"type":"electronic","value":"9783540691310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0022198","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T07:24:13Z","timestamp":1131866653000},"page":"72-82","source":"Crossref","is-referenced-by-count":2,"title":["Efficient transient overload tests for real-time systems"],"prefix":"10.1007","author":[{"given":"Guillem","family":"Bernat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Burns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Llamos\u00ed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"unstructured":"N. C. Audsley. Flexible scheduling in hard real-time systems. PhD theses. Department of Computer Science, University of York, 1993.","key":"7_CR1"},{"doi-asserted-by":"crossref","unstructured":"N. C. Audsley, A. Burns, R. I. Davis, K. W. Tindell, and A. J. Wellings. Fixed priority pre-emptive scheduling: An historical perspective. Real-Time Systems, 8, 1995.","key":"7_CR2","DOI":"10.1007\/BF01094342"},{"doi-asserted-by":"crossref","unstructured":"N. C. Audsley, A. Burns, M.F. Richardson, and Wellings A.J. Stress: A simulator for hard real-time systems. Software-Practice and Experience, 24(6), June 1994.","key":"7_CR3","DOI":"10.1002\/spe.4380240603"},{"doi-asserted-by":"crossref","unstructured":"N. C. Audsley, A. Burns, M.F. Richardson, and A.J. Wellings. Hard real-time scheduling: The deadline monotonic approach. In Proceedings of the 8th IEEE Workshop on Real-Time Operating Systems and Software. Atlanta., May 1991.","key":"7_CR4","DOI":"10.1016\/S1474-6670(17)51283-5"},{"doi-asserted-by":"crossref","unstructured":"N.C. Audsley, R.I. Davis, and A. Burns. Mechanisms for enhacing the flexibility and utility of hard real-time systems. In 15th Real Time System Symposium, December 1994., December 1994.","key":"7_CR5","DOI":"10.1109\/REAL.1994.342734"},{"doi-asserted-by":"crossref","unstructured":"A. Burns. Scheduling hard real-time systems: A review. Software Engineering Journal, 6(3), 1991.","key":"7_CR6","DOI":"10.1049\/sej.1991.0015"},{"doi-asserted-by":"crossref","unstructured":"M. Hamdaoui and P. Ramanathan. A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Transactions on Computers, 44(12), December 1995.","key":"7_CR7","DOI":"10.1109\/12.477249"},{"doi-asserted-by":"crossref","unstructured":"M. Joseph and P. Pandya. Finding respone times in a real time system. BCS Computer Journal, 29(5), October 1986.","key":"7_CR8","DOI":"10.1093\/comjnl\/29.5.390"},{"doi-asserted-by":"crossref","unstructured":"C. Juiz and R. Puigjaner. Approximate performance models of real time software systems. In Proceedings of MASCOTS 95, IEEE Computer Society Press, January 1995.","key":"7_CR9","DOI":"10.1109\/MASCOT.1995.378693"},{"key":"7_CR10","volume-title":"Technical report","author":"J.P. Lehoczky","year":"1987","unstructured":"J.P. Lehoczky, L. Sha, and V. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. Technical report, Tech. Report. Department of Statistics, Carnegie-Mellon, 1987."},{"doi-asserted-by":"crossref","unstructured":"J.Y.T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation (Netherlands), 2(4), December 1982.","key":"7_CR11","DOI":"10.1016\/0166-5316(82)90024-4"},{"doi-asserted-by":"crossref","unstructured":"C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1), January 1973.","key":"7_CR12","DOI":"10.1145\/321738.321743"},{"doi-asserted-by":"crossref","unstructured":"C.D. Locke, D.R. Voge, and R.J. Mesler. Building a predictable avionics platform in ada: A case study. In Real-Time Systems, San Antonio, Texas, 1991.","key":"7_CR13","DOI":"10.1109\/REAL.1991.160372"},{"doi-asserted-by":"crossref","unstructured":"L. Sha, R. Rajkumar, and J.P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronisation. IEEE Transactions on Computers, 39(9), September 1990.","key":"7_CR14","DOI":"10.1109\/12.57058"},{"unstructured":"K.W. Tindell. Fixed priority scheduling of hard real-time systems. PhD theses. Department of Computer Science, University of York, 1993.","key":"7_CR15"}],"container-title":["Lecture Notes in Computer Science","Computer Performance Evaluation Modelling Techniques and Tools"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:53:42Z","timestamp":1586552022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631019","9783540691310"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0022198","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}