S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan et al., On the competitiveness of on-line real-time task scheduling, Real-Time Systems Symposium, 1991. Proceedings., Twelfth, pp.106-115, 1991.

G. Bernat, A. Burns, and A. Liamosi, Weakly hard real-time systems, IEEE Transactions on Computers, vol.50, issue.4, pp.308-321, 2001.
DOI : 10.1109/12.919277

G. Bernat and R. Cayssials, Guaranteed on-line weakly-hard real-time systems, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420), pp.25-35, 2001.
DOI : 10.1109/REAL.2001.990593

R. Blind and F. Allgöwer, Towards Networked Control Systems with guaranteed stability: Using weakly hard real-time constraints to model the loss process, 2015 54th IEEE Conference on Decision and Control (CDC), pp.7510-7515, 2015.
DOI : 10.1109/CDC.2015.7403405

G. Buttazzo, M. Spuri, and F. Sensini, Value vs. deadline scheduling in overload conditions, Proceedings 16th IEEE Real-Time Systems Symposium, pp.90-99, 1995.
DOI : 10.1109/REAL.1995.495199

C. Giorgio, . Buttazzo, A. John, and . Stankovic, Adding robustness in dynamic preemptive scheduling, Responsive Computer Systems: Steps Toward Fault- Tolerant Real-Time Systems, pp.67-88, 1995.

C. Chang and R. L. Cruz, A time varying ltering theory for constrained traac regulation and dynamic service guarantees, INFOCOM '99, pp.63-70, 1999.

R. Cruz and M. Taneja, An analysis of traac clipping, 1998.

C. Umamaheswari, . Devi, H. James, and . Anderson, Tardiness bounds under global EDF scheduling on a multiprocessor, Real-Time Systems, vol.38, issue.2, pp.133-189, 2008.

G. Frehse, A. Hamann, S. Quinton, and M. Wöhrle, Formal Analysis of Timing EEects on Closed-loop Properties of Control Software, RTSS, 2014.

M. Hamdaoui and P. Ramanathan, A dynamic priority assignment technique for streams with (m, k)-firm deadlines, IEEE Transactions on Computers, vol.44, issue.12, pp.1443-1451, 1995.
DOI : 10.1109/12.477249
URL : ftp://ftp.ece.wisc.edu/pub/parmesh/inreview/dpa_simul.ps.gz

G. Koren and D. Shasha, Skip-Over: algorithms and complexity for overloaded systems that allow skips, Proceedings 16th IEEE Real-Time Systems Symposium, pp.110-117, 1995.
DOI : 10.1109/REAL.1995.495201
URL : http://ftp.gwdg.de/pub/languages/nyu.edu/tech-reports/tr715.ps.gz

S. Kramer, D. Ziegenbein, and A. Hamann, Real world automotive benchmarks for free, 2015.

P. John and . Lehoczky, Fixed priority scheduling of periodic task sets with arbitrary deadlines, RTSS, 1990. Proceedings., 11th. IEEE, pp.201-209, 1990.

M. Neukirchner, S. Stein, and R. Ernst, SMFF: System Models for Free, WATERS, 2011.

K. Richter, Compositional Scheduling Analysis Using Standard Event Models: The SymTA-S Approach, 2005.

W. Ken, A. Tindell, A. J. Burns, and . Wellings, An extendible approach for analyzing xed priority hard real-time tasks, Real-Time Systems, vol.6, issue.2, pp.133-151, 1994.

S. Tobuschat, R. Ernst, A. Hamann, and D. Ziegenbein, System-level timing feasibility test for cyber-physical automotive systems, 2016 11th IEEE Symposium on Industrial Embedded Systems (SIES), pp.1-10, 2016.
DOI : 10.1109/SIES.2016.7509419

E. Wandeler, Modular performance analysis and interface-based design for embedded real-time systems, Ph.D. Dissertation. ETH Zurich, 2006.

H. P. Williams, Model building in mathematical programming, 2013.

W. Xu, Z. Hammadeh, S. Quinton, A. Kröller, and R. Ernst, Improved Deadline Miss Models for Real-Time Systems Using Typical Worst-Case Analysis, 2015 27th Euromicro Conference on Real-Time Systems, 2015.
DOI : 10.1109/ECRTS.2015.29