1. Audsley, N. C. 1991. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Dept. Computer Science Report YCS 164, University of York.
2. Audsley, N., Burns, A., Richardson, M., Tindell, K., and Wellings, A. 1992. Applying new scheduling theory to static priority pre-emptive scheduling. Report RTRG/92/120, Department of Computer Science, University of York.
3. Baker, T. P. 1991. Stack-Based Scheduling of Realtime Processes.Real Time Systems, 3(1).
4. Garey, M. R., and Johnson, D. S. 1979.Computers and Intractibility, Freeman, New York.
5. Hutcheon, A. D. 1992. Timings of run-time operations in modified York Ada. Task 8, Volume C, Deliverable on ESTEC Contract 9198/90/NL/SF, York Software Engineering Limited, University of York.