K. Albers and F. Slomka, An event stream driven approximation for the analysis of real-time systems. proc, Euromicro Int. Conf. on Real-Time Systems (ECRTS'04), pp.187-195, 2004.

K. Albers and F. Slomka, Efficient feasibility analysis for real-time systems with edf scheduling. proc, Europe Conference (Date'05), 2005.
URL : https://hal.archives-ouvertes.fr/hal-00181560

N. C. Audsley, A. Burns, M. Richardson, K. W. Tindell, and A. J. Wellings, Applying new scheduling theory to static priority pre-emptive scheduling, Software Engineering Journal, vol.8, issue.5, pp.284-292, 1993.
DOI : 10.1049/sej.1993.0034

S. Baruah, E. Bini, T. Nguyen, and P. Richard, Continuity and approximability of response time bounds, Euromicro Conf. on Real-Time Systems (ECRTS'07), Work-in Progress, 2007.

E. Bini and S. Baruah, Efficient computation of response time bounds under fixed-priority scheduling. proc. Int. Real- Time and Network Systems, 2007.

E. Bini and G. Buttazzo, Schedulability analysis of periodic fixed priority systems, IEEE Transactions on Computers, vol.53, issue.11, 2004.
DOI : 10.1109/TC.2004.103

E. Bini and G. Buttazzo, Measuring the Performance of Schedulability Tests, Real-Time Systems, vol.20, issue.1, pp.129-154, 2005.
DOI : 10.1007/s11241-005-0507-9

S. Chakraborty, S. Kunzli, and L. Thiele, Approximate schedulability analysis, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002., 2002.
DOI : 10.1109/REAL.2002.1181571

N. Fisher and S. Baruah, A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. proc, Euromicro Int. Conf. on Real-Time Systems (ECRTS'05), pp.117-126, 2005.

N. Fisher and S. Baruah, A polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines, Proc. Int. Conf. on Real-Time Systems (RTNS'05), pp.233-249, 2005.

N. Fisher, T. Nguyen, J. Goossens, and P. Richard, Parametric polynomial-time algorithms for computing responsetime bounds for static-priority tasks with release jitters, 13th IEEE International Conference on Embedded and Real- Time Computing Systems and Applications (RTCSA'07), 2007.

M. Joseph and P. Pandya, Finding Response Times in a Real-Time System, The Computer Journal, vol.29, issue.5, pp.390-395, 1986.
DOI : 10.1093/comjnl/29.5.390

J. Lehoczky, Fixed priority scheduling of periodic tasks with arbitrary deadlines. proc, IEEE Int. Real-Time System Symposium (RTSS'90), pp.201-209, 1990.

J. Lehoczky, L. Sha, and Y. Ding, The rate monotonic scheduling algorithm: exact characterization and average case behavior, [1989] Proceedings. Real-Time Systems Symposium, pp.166-171, 1989.
DOI : 10.1109/REAL.1989.63567

Y. Manabee and S. Aoyagi, A feasible decision algorithm for rate monotonic and deadline monotonic scheduling. Real- Time Systems Journal, pp.171-181, 1998.

P. Richard and J. Goossens, Approximating response times for static-priority tasks with release jitters, WIP, Euromicro Int. Conf. on Real-Time Systems (ECRTS'06), 2006.

P. Richard, J. Goossens, and N. Fisher, Approximate feasibility analysis and response-time bounds of static-priority tasks with release jitters, proc. Int. Real-Time and Network Systems, 2007.